(3%) Given an undirected weighted graph $G = (V, E)$, where $V = \{A, B, C, D, E\}$, the edges and their corresponding weights are illustrated in the following figure. How many distinct minimum spanning trees (MSTs) can be formed from the graph $G$ using Kruskal's or Prim's algorithm?