1. Some questions about drawing Ok graphs on surfaces. A. Show that Q3 can be drawn on the plane. B. Use the fact that Q4 is bipartite and a total edge count argument to show that Q4 cannot be drawn on the plane. C. Draw Q4 on the torus (use the aba-1b-1 square representation drawn below). HINT: Q4 is isomorphic to C4 XC4- D. Show that g(Q) > 5. Recall that for Qs we have n = 32 and m = 80. As a first step, use a total edge count argument to show that rs 40. Feed this information into Euler's formula n-m+r = 2-2 g(Q). E. (*) Generalize the strategy in part D to obtain a "meaningful lower bound for g(ok). Here, recall that n 2k and m = k2k-1 = 1. Some questions about drawing Ok graphs on surfaces. A. Show that Q3 can be drawn on the plane. B. Use the fact that Q4 is bipartite and a total edge count argument to show that Q4 cannot be drawn on the plane. C. Draw Q4 on the torus (use the aba-1b-1 square representation drawn below). HINT: Q4 is isomorphic to C4 XC4- D. Show that g(Q) > 5. Recall that for Qs we have n = 32 and m = 80. As a first step, use a total edge count argument to show that rs 40. Feed this information into Euler's formula n-m+r = 2-2 g(Q). E. (*) Generalize the strategy in part D to obtain a "meaningful lower bound for g(ok). Here, recall that n 2k and m = k2k-1 =