Extremal Graph Theory and Ramsey Theory · Superchallenge problem

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