[6 marks] The graph includes a Euclidean instance of the TSP (slightly different from in the AH2 previous question. All edge lengths are given in increasing order AB? V4 CE CG AF V8 BE V8 EG 10 10 AD V13 BC | V17 DH V17 AG1 BF 20 Suppose we generate a Greedy Algorithm route for this graph in a slightly different CD 20 way than in 2(a): with edges that are tied for length, instead of considering tose 20 edges for inclusion in alphabetical order, we make a random permutation of the tied DG 25 GH 32 Determine with justification the probability that this method w generate the route BGv3 edges and consider them for inclusion in the permuted order FG AH BFCGDEA DF V41 [6 marks] The graph includes a Euclidean instance of the TSP (slightly different from in the AH2 previous question. All edge lengths are given in increasing order AB? V4 CE CG AF V8 BE V8 EG 10 10 AD V13 BC | V17 DH V17 AG1 BF 20 Suppose we generate a Greedy Algorithm route for this graph in a slightly different CD 20 way than in 2(a): with edges that are tied for length, instead of considering tose 20 edges for inclusion in alphabetical order, we make a random permutation of the tied DG 25 GH 32 Determine with justification the probability that this method w generate the route BGv3 edges and consider them for inclusion in the permuted order FG AH BFCGDEA DF V41