hey guys i am desperate,

given a graph, G, with m edges, prove that G contains at most (m^2)/2 cycles of length 4 (sub-graphs not necessarily induced).

sorry guys for asking for help on my homework