In Dijkstra's Algorithm, the shortest paths are generated in topological order. Select one: True False To print the elements of binary search tree in increasing order, preorder traversal should be used. Select one: True False In the spaly tree, any tree operation takes at most o log N) time. Select one: True False Divide and conquer method is used in Mergesort. Select one: True False The worst case for quicksort is that each partition pick the smallest key or largest key as the pivot. Select one: True False