Determine the number of edges in a bipartite graph where the two sets of vertices have sizes $m=4$ and $n=5$, and every vertex in the first set is connected to every vertex in the second set.