Bipartite Graphs and Matchings · Challenge problem

A bipartite graph has $3$ rows and $4$ columns. What is the largest number of edges it can have while containing no $4$-cycle (no two rows sharing two common column-neighbors)?