3. This question is about minimum spanning tree. Consider four coordinate points, A = (-1, -3), B = (17, 3), C = (-8, 7), D = (10, -5) a. Construct the distance matrix for the four points above, using...

Extracted text: 3. This question is about minimum spanning tree. Consider four coordinate points, A = (-1, -3), B = (17, 3), C = (-8, 7), D = (10, -5) a. Construct the distance matrix for the four points above, using Manhattan distance (L1 norm). For example, distance between (0, 0) and (1, 1) is |(0-1)| + |(0-1)| = 2. b. Using Kruskal's algorithm, find a minimum spanning tree for the distance matrix above. Illustrate intermediate steps with an edge list and a table. c. In general, if we use Euclidean distance instead of Manhattan distance, we sort the edge list based on the weights, is the sorted order the same? Explain your answer.