Extremal Graph Theory and Ramsey Theory · Challenge problem

A bipartite graph has parts of size $4$ and $4$ and contains no $4$-cycle. What is the maximum number of edges it can have?