Select an application of Queue. O a. Postfix expression evaluation O b. Backtracking O c. None of the above O d. CPU Scheduling How many maximum number of passes requires for sorting an array of n elements using selection sort technique? O a. n-1 O b. n 0 C. n * n. O d. None of these In a strict binary tree, each node can have O a. Less than or equal to two child nodes O b. Only two child nodes O c. Two or no child. O d. More than two child nodes Which of the following is false about a circular linked list? O a. In a CLL, all nodes are linked in a continuous circle, without using null. O b. It has no beginning and no end O c. Time complexity for deleting the last node is O(1) O d. A singly linked list can be made a circular linked list by simply storing the address of the very first node in the linked field of the last node. If the elements "A, B, C and D are placed in a stack and are deleted one at a time, in what order will they be removed? O a. DCBA O b. ABBC O c. DCAB O d. ABCD