4. (25 pts) Consider the following unweighted graph, and assign the edge weights (using positive integer weights only), such that the following conditions are true regarding minimum spanning trees (MST) and single-source shortest path (SSSP) trees: . The MST is distinct from any of the seven SSSP trees. . The order in which Prim's algorithm adds the safe edges is different from the order in which Kruskal's algorithm adds them