18 (10 points) True or False No. Question Circle one that applies 01 True / False 02 True 1 False 03 True / False To apply Binary Search (BS), the given sequence is not necessary to be already sorted in non-decreasing order. Binary Search Tree (BST) can be used to sort the given sequence by taking pre-order traversal. For a given undirected, weighted Graph (G), we should find only one unique Spanning Tree (ST). For a given undirected, weighted Graph (G), we should always find only one Minimum Spanning Tree (MST). For a given directed Graph (G), there might exist multiple Topological Sort results. Shell Sort is a generalization of Selection Sort 04 True 7 False 05 True / False 06 True / False True 07 / False Selection Sort is more flexible than Heap Sort, in terms of selecting min or MAX. Selection Sort is less flexible than Heap Sort, in terms of swapping step. 08 True 1 False 09 False In Heap Sort, we build up an initial heap from Complete Binary Tree (CBT) only once (right-to-left and bottom-to-top direction). After then, we never build a whole heap any more from scratch, but just we fix (i.e., rebuild) a heap only for the affected triangles (top-to-bottom direction). True / 10 In node deletion operation in Binary Search Tree (BST), either left-most child (i.e. smallest) of left subtree or right- most child (i.e., largest) of right subtree can take over the position of the node that are to be deleted. After then, the deletion is recursively processed for the affected nodes. True / False