The Array Collection problem accepts a positive integer k and collection of n sorted arrays containing integers between 1 and k. The output of this problem is a subset of the arrays such that every number 1-k appears in exactly one array, or an empty set, if no solution exists. For example, if k 5 and we are given the arrays [1,3,5, 1,2,5], [2, 3], and 2,4], the solution would be [1,3,5], [2,4]) Answer questions 1 and 2 below about the Array Collection problem 1. Give pseudocode for a greedy algorithm for the Array Collection problem 2. Prove that your algorithm is not correct. (There is no greedy algorithm 3. Find the worst-case time complexity of the FriendOfFriend algorithm be- Note that there is more than one reasonable answer to this problem. that correctly solves this problem.) low when using an adjacency matrix to represent the graph. Show your work. Input: G- (V, E): graph with n vertices and m edges Input: n, m: order and size of G 1 Algorithm: FriendOfFriend 2 for ve V do 3 | for u ? N(v) do for w E N(u) do if u w and u and w are not adjacent then | G.AddEdge(v, w) 5 6 7 8 9end en 10 end 11 return G