Reference: There is no reference, K4, K5 etc. is the given. We need to construct a graph from the given. This is Discrete Mathematics, right now dealing with Euler circuits, paths, Hamilton Circuits paths etc. This is the given study exercise, but I need help solving it. This is all that is given, nothing else is given. I hope this helps and let me know if anything else is needed or if I can help in anyway. Thank you for your time.

Part I: Crossing Numbers The crossing number cr(G) of a graph G is the minimum number of edge crossings of a "plane" drawing of the graph G. For instance, a graph is planar if and only if its crossing number is zero. 1) Find the crossing number for each of the graphs and give a drawing of the graph that supports your answers. a) KA b) Ks c) 238. Suppose that a fair coin is tossed three times. The sample space is {HHH , HHT , HT H , T HH , HTT,THT, TTHJ'TT}. Notice the following events: 0 tails: l; 1 tail: 3; 2 tails: 3; 3 tails: 1 Note that this is the 3rd row (hence 3 coins) of Pascal's Triangle. Now suppose that a fair coin is tossed ten times. Construct the 10th row of Pascal's angle (using combinations) and use it to answer the following questions. many outcomes are possible? ,, fire ' ' Y