Can u solve this and explain it clearly. TY

Now consider the social network below: 2 2 5 5 1 3 6 4 7 Recall the definition of cover from the previous problem: A subset of people (nodes) in the network is a cover if every person in the network is either part of the subset Soris friends with someone in the subset s. What is the size of the smallest possible cover for the network above? Select the nodes that form part of the smallest vertex cover? 2,3,4 1,4,7 1,5,7 1,5,6,7 Now consider, again, the greedy algorithm discussed in the previous problem: 1. Choose the person with the largest number of friends. 2. Add the person to the cover, and delete the person and his/her friends from the network 3. Repeat 1-3 until the network is empty of people. Running the greedy algorithm on the network above, what is the first node selected for the cover? What is the size of the cover discovered by the greedy algorithm