Please help!! I have been having confusion with solving these spanning tree problems how would this problem be solved? are you supposed to get three different answers? I need help

BARRY RENDER . RALPHM. STAIR, JR. . MICHAELE, HANNA . TREVORS. HALE Name 2. Suppose you are installing power lines in a housing development and you want to minimize the total length of wire to use. The housing network is outlined below. Each house (node) is represented by a letter and the distances between the houses are on the are connecting the nodes. 200 D 100 100 100 50 50 A F 200 100 C 40 E Use the minimal-spanning tree technique to determine the minimum distance that can be used to connect all of the houses. What is the total length of the shortest path