We define the decision version of the minimum spanning tree problem discussed earlier in class as follows: Given a graph G = (V,E), a cost function c: E N, and a number k E N, the problem Spanning Tree asks whether there exists a spanning tree T (i.e., a subset of E that connects all vertices in V and does not contain cycles) such that the sum of the cost of all edges in T is at most k For each Yes, i) No, or i) Unknown, because it would resolve the question of whether P-NP. Give a brief explanation of your answer of the two questions below, decide whether the answer is (6) (a) Question: Is it the case that Spanning Tree Sp Independent Set? (b) Question: Is it the case that Independent Set Sp Spanning Tree? You can use that Independent Set is an NP-complete problem We define the decision version of the minimum spanning tree problem discussed earlier in class as follows: Given a graph G = (V,E), a cost function c: E N, and a number k E N, the problem Spanning Tree asks whether there exists a spanning tree T (i.e., a subset of E that connects all vertices in V and does not contain cycles) such that the sum of the cost of all edges in T is at most k For each Yes, i) No, or i) Unknown, because it would resolve the question of whether P-NP. Give a brief explanation of your answer of the two questions below, decide whether the answer is (6) (a) Question: Is it the case that Spanning Tree Sp Independent Set? (b) Question: Is it the case that Independent Set Sp Spanning Tree? You can use that Independent Set is an NP-complete