2) (10pts) Given that we start from node F and use Prim's algorithm, find the order of nodes and edges added onto the MST by completing the table below. Start: 15 14 13 16 17 20 12 Nodeledge P.key. A.key. B.key. Ckey. Dkey, Eke Gkey, H.key Lkey added parent(F) parent(A) parent(B) parent(C) parent(D) parent(E) parent(G) paren(H parent) onto MST 0, F on null-To, null??null-ta.null-e,null??.nall-Ton, mull- le, nall 6, F ao, null,null 15, F 16, F node G, edge (F G)