Question (1): Are the following statements valid or invalid, justify your answer? (5 Marks) Given a weighted graph where weights of all edges are unique (no two edge have same weights), there is always a unique shortest path from a source to destination in such a graph. An edge is light if its weight is minimum of all edges crossing the cut. 3. Every graph G has a single spanning tree which is tree (cyclic) and connect all the vertices in Time Complexity of QuickSort is O(n^2) 5. For any two functions f(n) and g(n), we have f(n) = (g(n)) if and only if f(n) = O(g(n)) and f(n) = Q(g(n))