2. There are bridges to be made connecting different parts of the city. The goal is to find which bridges we have to make to connect all parts of the city with minimum cost. Pi represents region i in the city, and the weight of an edge between Pi and Pj represents the cost of building a bridge connecting the region i to region j in the city. - Which greedy algorithms described in the class can be used to solve this problem?(0.5 mark) - Run one greedy algorithm you mentioned to find the bridges that must be constructed to minimize the cost?(1 mark) - What is the minimum cost?(0.5mark)