1. Steiner tree Four villages are located at the vertices of a unit square in the Euclidean plane. You are asked to connect them by the shortest network of roads so that there is a path between every pair of the villages along those roads. Find such a network.
2. Write a program generating a random maze based on
a. Prim's algorithm.
b. Kruskal's algorithm