consider the following undirected graph: 1 6 2 4 3 8 5 7 1. How Many Spanning Tree are possible for this graph? 2. Please use the Prim-Jarnik Algorithm to write down the order in which the vertices are visited and find MST. 3. Apply Topological Sort Algorithm (Backward) Topological Ordering and write down possible topological ordering. 4. Apply Topological Sort Algorithm (Forward) Topological Ordering and write down possible topological ordering. Act Go