Problem #5: One night Roberto was walking home from the Math&CS Building when he was attacked Luckily, the dog was satisfied with biting only Roberto's notebook . The next da igure out what was the algorithm that he had written on one badly da Here's what the page looks like: hen y Roberto tries to maged page of the notebook. Algorithm [.. hole in the page...] input: weighted graph G with N vertices and M edges. output: set S of edges of G such that [... hole in the page...] begin pick an arbitrary vertex s; A Is); B (adjacent vertices of s): repeat find edge (u; v) of minimum weight such that ue A and ve B; add (u; v) to S remove v from B and add it to A; for each vertex w adjacent to v do if (wE AUB) then add w to B: until (B 0) end I... rest of the page eaten by the dog...] our task is to figure out what is the algorithm described by the above pseudo-code. (20 pts) What is the set of edges S returned by the algorithm? (20 pts) What is the time complexity of the algorithm? (10 pts) Give an example of a practical problem that can be solved by applying the algorithm