PLEASE PROVIDE ALL THE ANWERS IN PYTHON PROGRAMMING TO THE QUESTIONS WITH PROPER SCRRENSHOT OF OUTPUT AND DIAGRAM REQUIRED IN QUESTION WITH EXPLANATION.

Qn.1 : PLEASE ANSWER IN PYTHON PROGRAMMIN WITH PROPER CODE, SCREEENSHOT AND CODE NOT USED IN LEETCODE.

Qn.2 : PLEASE ANSWER IN PYTHON PROGRAMMIN WITH PROPER CODE, SCREEENSHOT AND CODE NOT USED IN LEETCODE.

Qn.3 : PLEASE ANSWER IN PYTHON PROGRAMMIN WITH PROPER CODE, SCREEENSHOT AND CODE NOT USED IN LEETCODE.

There are n cities labeled from 1 to n. You are given the integer n and an array connections where connections [i]=[xi,yi,c1ti] indicates that the cost of connecting city xi and city yi (bidirectional connection) is cost ti. Return the minimum cost to connect all the n cities such that there is at least one path between each pair of cities. If it is impossible to connect all the n cities, return 1. The cost is the sum of the connections' costs used. Example 1: Input: n=3, connections =[[1,2,5],[1,3,6],[2,3,1]] Output: 6 Explanation: Choosing any 2 edges will connect all cities so we choose the minimum 2. Example 2: Input: n=4, connections =[[1,2,3],[3,4,4]] Output: 1 Explanation: There is no way to connect all cities even if all edges are used. 6. Use Prim approach to find Minimum Spanning Tree - CSE_2009_38.jpg . Please use MST approached propsed by Prim to find the MST of the following diagram and then compare their Time Complexity. 7. Use Kruskal approach to find Minimum Spanning Tree - CSE_2009_38.jpg . Please use MST approached propsed by Kruskal to find the MST of the following diagram and then compare their Time Complexity