Number 5 parts a,b,c. b and c are continued onto the next page.

Answer the same questions as in Exercise 3 for the graph in Figure 9(b). (a) How many Hamilton circuits does the graph K_n, n have for n greaterthanorequalto 2? [Count circuits as different if they have different starting points or different vertex sequences.] (b) How many Hamilton paths does K_n, n-1 have for n greaterthanorequalto 2? (c) Which complete bipartite graphs K_m, n have Euler paths? For n greaterthanorequalto 3, build a graph K^++_n from the complete K_n - 1 by adding one more vertex and an edge new vertex to a vertex of K_n - 1. [Figure 1(c) K^++_5.] Show that K^++_n is not Hamiltonian