Tree: Vo v1 V2 V3 V4 DistTO CandidateEdge T* V12 TV2 5 T V39 from v2 T* V49 from v1 from vO from v1 In-Class Exercise of the Day (Week11B)- Shortest Path - (4 people per team) 5 pts Q1: What is the best path from vo to v3 in the above table? Hint: look at the "from" information on candidate edges. Q2: What would be the W(n) for this algorithm? Hint: The while loop must include all vertices to Tree. Inner loops must look at all adjacent vertices