Fill each blank with the most appropriate integer in the following proof of the theorem
Theorem.For every simple bipartite planar graph G=(V,E) with at least 3 vertices,we have
|E|<2|V4.
Proof.Suppose that G is drawn on a plane without crossing edges.Let F be the set of faces of Gand let v=|V,e=Ef=|FI.For a face r of G,let deg r be the number of edges on the boundary of r Since G is bipartite,G does not have a cycle of length __ so every face has at least __ edges on its boundary. Hence, deg r > ___for all r E F. On the other hands,every edge lies on the boundaries of exactly ___ faces,which implies