Qruesticn Not yat anawdne city to another to minimize the overall time of the flight? Marked out of 1.00 Suppose you have a directed graph representing all the flights that an airline flies and the flying times for each connection. What algorithm might be used to find the best sequence of connections from Select one P Flag queitiona a. Breadth first search. O b. Depth O C. A cycle-finding algorithm O d. A shortest-path algorithm. first search. Queation 9 Not yet answered Marked out of 1.00 Breadth first search Select one O a. Scans each incident node along with its children. O b. Scans all Incident edges before moving to other node O , ls same as backtracking O d. Scans all the nodes in random order. O e. Scans all the nodes in pre-order manner. P Flag question Question 10 Not yet answered Maked out of 1.00 True False: Dijkstra's algorithm finds the shortest paths in a graph from all vertices to a given vertex Select one O True O False Flag question Quaation What is the Big-Oh complexity of the selection sort? Select one O a O(n) O b. o(log n) Not yet anawered Makod out ot 1.00 Flag question o d. 0(2')