Question 1: Assume a reversed implementation of the Kruskals Algorithm is introduced to find an MST, where T is initialized to be the set of all edges E of a graph G and all edges are sorted in decreasing order. When traversing each edge, the reversed Kruskals Algorithm deletes an edge from T if it forms a cycle. If we assume all edge costs are distinct, does the reversed Kruskals Algorithm compute an MST? Please discuss and justify your answer in detail on an example graph you give.