moving to another question will save this response. Question 12 List the vertices of the following graph in the order they will be visited by the Topological Sort algorithm Note: If at any time you have more than possible vertex to visit, you MUST visit them alphabetically C A B E G D LL F If the image does not show automatically.click this link to display.it TTT Arial 3(120) TEE 5. Remaining Time: 1 hour, 47 minutes, 26 seconds. Question Completion Status: List the vertices of the following graph in the order they will be visited by the Topological Sort algorithm: Note: If at any time you have more than possible vertex to visit, you MUST visit them alphabetically B F E A If the image does not show automatically, click this link to display it. TTT Arial " 3 (12pt) TEE Question Completion Status: minutes, 56 seconds. Insert key 95 into the following B-Tree of order 3 and use your resulting tree to answer the following: Write down the nodes of the resulting tree level-by-level (top-to-bottom, left-to-right) in the following format: Level 1:... Level 2: etc. Notes: (1) Enclose the keys in each node within square brackets, separating them by commas [1,2,3] (2) No need to arrange the nodes to look like a tree, just list nodes in each level. 10 20 60 50 80 93 If the image does not show automatically. click this link to display it TTT Arial 3 (12pt) ···· ö a ין O 1:12 AM ENG 5/6/2020