true -false

1) Merge sort algorithm sorts use auxiliary memory. 2) Sorting the n people born in 2010 bv their birth date using "Bubble Sort" will be done in O(n) 3) If f(n)-6 g(n) then g(n) =n). 4 The insertion sort has large constants and hence is inefficient even for small input size. 5On), O(n log n), O(n?), O(n2 log n) is the right order from best to worst complexity 6) Finding the largest element in a linked list of size n is of O(log n). 7) In a stack, if we implement push(6), push(4), pop(0, pop), pop(), push(4), push(6), pop() the remaining value in the stack will be 4. 8) If the "bubble-sort is implemented on the array A[34, 26, 43, 17, 37, 31, 44], after the first 9) 10) the following code is used to remove current node in a double linked list two cycles the array will be A[26, 17, 34, 31, 37, 43, 44] Stack is called last in last out. current. prev .next = currentnext current.next.prev - current.prev currentcurrent.prev