Using Prim’s Algorithm, determine the minimum spanning tree of the following graph. Which edge, written in the format of: (startnode, endnode), is NOT included in the minimum spanning tree?
Please enter your answer in the following format: (#,#)
The correct answer is: (1, 8)
