1) Use Fleury's algorithm to determine an Euler circuit, starting with Vertex A a) A,B,F.E.B.C,G,F,C.D.H.G.K.BA b) A,B,K,G,H,D,C.K.F.E.A c) A,B,C,D,H,G,K,B,F.K.C,G,F.E.A 2) Does the graph have an Euler Circuit? If so, find one using Fleury's algorithm, starting with vertex A D a) B,C,F,G,E.E.D.C.G.B.F.A b) A,B,C,D.G.C.E.F.B.E.G.F,A c) A,B,F,E,C,G,E,B,C,D,G,F,B 3) Determine whether the graph shown is connected or disconnected. a) Connected b) Disconnected None of these 4) How many vertices would a complete graph with 5040 unique Hamilton circuits have? a) 6 vertices b) 8 vertices 1.) 10 vertices d) 12 vertices 5-6) Apply the Brute Force algorithm to find an optimum solution on the given complete weighted graph. 5) List of all possible Hamilton circuits. b) B.A.C.D.B or B,D,C,A,B A,B,C,D,A or A.D.C.B.A C.B.4,D,C or C,D.A,B,C B.A.D.C.B or B,C,D,A,B A,B,D,C,A or A,C,D,B.A C.B.D,A,C or C.A.D,B,C B,C,A.D.B or B.D.A.C.B A.C.B.DA or A,D,B,C.A C,A,B,D,C or C,D.B.A.C 6) Calculate the price of each circuit found in step one and pick the optimal solution - the smallest value. a) 21 b) 23 0 25 1) Use Fleury's algorithm to determine an Euler circuit, starting with Vertex A a) A,B,F.E.B.C,G,F,C.D.H.G.K.BA b) A,B,K,G,H,D,C.K.F.E.A c) A,B,C,D,H,G,K,B,F.K.C,G,F.E.A 2) Does the graph have an Euler Circuit? If so, find one using Fleury's algorithm, starting with vertex A D a) B,C,F,G,E.E.D.C.G.B.F.A b) A,B,C,D.G.C.E.F.B.E.G.F,A c) A,B,F,E,C,G,E,B,C,D,G,F,B 3) Determine whether the graph shown is connected or disconnected. a) Connected b) Disconnected None of these 4) How many vertices would a complete graph with 5040 unique Hamilton circuits have? a) 6 vertices b) 8 vertices 1.) 10 vertices d) 12 vertices 5-6) Apply the Brute Force algorithm to find an optimum solution on the given complete weighted graph. 5) List of all possible Hamilton circuits. b) B.A.C.D.B or B,D,C,A,B A,B,C,D,A or A.D.C.B.A C.B.4,D,C or C,D.A,B,C B.A.D.C.B or B,C,D,A,B A,B,D,C,A or A,C,D,B.A C.B.D,A,C or C.A.D,B,C B,C,A.D.B or B.D.A.C.B A.C.B.DA or A,D,B,C.A C,A,B,D,C or C,D.B.A.C 6) Calculate the price of each circuit found in step one and pick the optimal solution - the smallest value. a) 21 b) 23 0 25