The algorithm specified is similar to the algorithm to find the minimal spanning tree using Kruskal's Algorithm, which uses disjoint set data structure. But, the edges are sorted in descending order here.
So, option (1) is true and (2) is not true.
Since, in a tree, for n vertices, we have n-1 edges, so m-n+1 edges will be deleted from a graph with m edges. So, option (3) is true.
Hence, option (4) is not true.