By giving the vertex set $V,$ edge set $E$ and the edge weights explicitly, construct a weighted connected graph $G=(V,E)$ on $10$ vertices and $24$ edges. Give random weights to its edges. The weights should be any number from the set $\{1,2,3,4\}$ and each of them should be used at least three times, i$.$e$.,$ there should be at least three edges with each of there weights.

Draw the graph $G$ that you constructed in Part $1.$

Implement Prim's Algorithm in Python: Write a Phyton code that takes as input a weighted graph $G$ represented as an adjacency matrix and uses Prim's algorithm to find a minimum spanning tree of G$.$ Recall that in the adjacency matrix, if there is an edge between vertex

i and vertex $j,$ then that entry will be the weight of that edge $($instead of $1).$

Implement Kruskal's Algorithm in Python. You can use an adjacency list or an adjacency matrix to represent the graph.

Run the codes you gave in Part $3$ and Part $4$ on the graph that you constructed in Part $1.$

For your graph $G$ find a matching $M$ that is maximal but not maximum.

please write as simple pyhton code as possible