Problem statement: a Briefly describe how does the selection sort algorithm work? What is the time complexity of selection sort? b. Sort the data given below using BUBBLE Sort technique [show swapped nodes in each step (if any) by underlining it). 23 35 14 76 34 10 Question 02: _5 Marks] Problem statement: Write an algorithm / code to merge two linked lists of students. The data part in each node of the first linked list, say 'male..list", consists of MALE student's information (name, id, program). Similarly, the data part in each node of the other list, say 'female list', consists of the information of FEMALE students. These linked lists should be merged such that, in the resultant.list no two MALE or FEMALE records are consecutive. Assume both input lists have equal length. (Hint: traverse both the lists step-by-step starting from their head nodes, and add item from appropriate list to the resultant list.] Problem statement: Write a code/algorithm, which takes two sorted integer stacks intstack_1' and intstack_2" (with minimum value on 'top' and the maximum value at the bottom) as input. The algorithm should output a single sorted stack result.stack' of all the values (with the minimum value on 'top' and the maximum value at the bottom). The algorithm should fulfill the following constraints: Only stack operations are allowed, and they are already implemented (pop, push, top, isEmpty isFull etc.). No other data structure is allowed except stack. The algorithm must work correctly for input stacks of different sizes. [Hint: you will have to use an additional stack.] Problem statement: Assume that a queue 'int.queue' is implemented using an integer array. Write an algorithm/code max.in queus", which finds the maximum element in the queue. The algorithm should fulfill the following constraints. Only queue operations are allowed, and they are already implemented (enqueue, dequeue, head, isEmpty isFull etc.). No other data structure is allowed except queues. There should be no change in the queue after finding the maximum. [Hint: you will have to use an additional queue.] Problem statement: a. Differentiate between linear and non-linear data structures. Is BST a linear or non-linear data structure? What is the fundamental characteristic of a binary search tree? b. Consider the following BST. 30 15 60 7 22 45 75 17 27 Insert the following items into this BST and then write down the post-order traversal of the tree. i. 23 55 40 Then, insert the following elements into the resultant tree and then write down the pre-order traversal of the tree. ii. 90 0 20