Question 6 (1 point) Make is a utility that automatically builds executable programs and libraries from source code by reading files called makefiles which specify how to derive the target program. Which of the following standard graph algorithms is used by Make. 1) Strongly connected components 2) Dijkstra's shortest path 3) Breadth first search 4) Topological sorting Save Question 7 (1 point) Path finding in a graph can be acheived using a depth first search, a good approach is to use ato keep track of the path between the start vertext and the current Save Question 8 (1 point) Watch the video at https://www.youtube.com/watch?v tYPUvEZF8XE in the tree using post-order traversal, what is the first node visited? Save