You are visiting Fantasia World again with your family today. As this is not your first time to visit the theme park, your main goal is just to visit their newest attraction the Space Odyssey (SO). Thus, you want to determine the fastest way to get there from the park entrance to avoid long lines at the ride. The table below summarizes the distances between the 10 park attractions and the park entrance, dash entries on the table mean that the two locations are not directly connected or accessible from each other. Park Entrance Dragon's Flight (DF) Enchanted Carousel (EC) Fairyland Forest (FF) Wizard's Academy (WA) Pirate's Cove (PC) Time Traveler (TT) Jungle Safari (JS) Wonderland Maze (WM) Haunted Manor (HM) DF EC 4 3 FF WA 6 54 1 2 PC A. Draw the network representation of this problem. 1 1 co 6 2 5 1 TT 25 1 1 2 2 1 B. Develop the optimal plan that would minimize total distance. JS WM HM SO 1 I 4 1 1 1 2 2 5 2 - 2 1 5 - - 3 7 8 4