Problems B5: Maximal Independent Set - Given a graph G=(V,E), that represents a social network in which each vertex vV represents a person, and an edge (u,v)E represents the fact that u and v know each other. - Maximal Independent Set Problem is to organize the largest party in which nobody knows each other. - James Gatz (Great Gatsby) wants to use Greedy Agorithm to solve this problem: - Start by choosing an arbitrary vertex and mark it as part of the MIS; -. Remove all its neighbors from the graph; - Repeat the process until there are no more vertices left in the graph. - Will he guarantee a party with the largest number of guests? If not, provide a counterexample