Question 2: The graph structure given below will be used for this question. Which word will come to which node is indicated in the graph. Write the word string you created in step 2 above to the nodes indicated on the graph. Answer the options a and b using the graph you created after creating the graph, Note: When answering the options a and b, when you need to choose between the neighbors of a node choose the last one alphabetically first. For example, node E has priority over node C. PSA 2. word word word JU 5. word 6 word word 10. word word word a) Starting from the PSA node, sort the nodes according to the postorder logis? Show the steps of the process? b) List by finding the shortest paths from the PSA node to all other nodes using the algorithm in Diliks? Show the steps of the process? Take the distances between podes as unit distance or 1 unit? Question 2: The graph structure given below will be used for this question. Which word will come to which node is indicated in the graph. Write the word string you created in step 2 above to the nodes indicated on the graph. Answer the options a and b using the graph you created after creating the graph, Note: When answering the options a and b, when you need to choose between the neighbors of a node choose the last one alphabetically first. For example, node E has priority over node C. PSA 2. word word word JU 5. word 6 word word 10. word word word a) Starting from the PSA node, sort the nodes according to the postorder logis? Show the steps of the process? b) List by finding the shortest paths from the PSA node to all other nodes using the algorithm in Diliks? Show the steps of the process? Take the distances between podes as unit distance or 1 unit