Write a code that follows the pseudocode in the attached image to fined Maximum independent set for an undurected graph using the greedy method.. The data entered for the code must be through an external file containing the numbers v and e. Please support this code in the comment

set Alg 6: SNMD Input : A graph G(V.E) Output: Independent set that is very close to Maximum independent Process : begin Ind_set: ; while there is v in V such that degree(G) 0 do begin voselect_min_node(); /* select_min_node: does search on the nodes of Gto find the node that has smallest degree. If there are more than one, choose the first one." G:-G-v-neighbor(v); ind_set -ind_setu tv) end; ind_set:indset U all vi EG end