Question textGive three topological orderings of the vertices of the graph below. a b c d e f g h Provide three distinct topological orderings below. One ordering per line. One vertex index per box. Ordering 1: Answer 1 Question 1[input] → Answer 2 Question 1[input] → Answer 3 Question 1[input] → Answer 4 Question 1[input] → Answer 5 Question 1[input] → Answer 6 Question 1[input] → Answer 7 Question 1[input] → Answer 8 Question 1[input] Ordering 2: Answer 9 Question 1[input] → Answer 10 Question 1[input] → Answer 11 Question 1[input] → Answer 12 Question 1[input] → Answer 13 Question 1[input] → Answer 14 Question 1[input] → Answer 15 Question 1[input] → Answer 16 Question 1[input] Ordering 3: Answer 17 Question 1[input] → Answer 18 Question 1[input] → Answer 19 Question 1[input] → Answer 20 Question 1[input] → Answer 21 Question 1[input] → Answer 22 Question 1[input] → Answer 23 Question 1[input] → Answer 24 Question 1[input] In case you do not recall how to find topological orders, we provide an algorithm below, as given in the course notes. You may refer to it to help you answer this question. [table] 1 2 3 4 5 6 7 8 9 10 11 12 13 14 | function TOPOLOGICAL_SORT(G = (V, E)) order = empty array visited[1..n] = false for each vertex v = 1 to n do if not visited[v] then DFS(v) return reverse(order) function DFS(u) visited[u] = true for each vertex v adjacent to u do if not visited[v] then DFS(v) order.append(u) // Add to order after visiting descendants [/table]多项填空题