Bipartite Graphs and Matchings · Superchallenge problem

Among all bipartite graphs with $|X|=|Y|=4$ having EXACTLY $7$ edges, what is the SMALLEST possible value of the maximum matching?