Algorithms, Data Structures and Computability

plz quickly

A) What is the complexity of the following tasks? (5 marks: 1 mark each) 1) Sorting a group of numbers of size N by keep dividing them into small groups of two items, sorting the two items, and then merging these groups again into a complete sortec list. 2) Finding the largest element in a queue of size n, given that these elements have been sorted using Bubble sort algorithm. 3) Finding the smallest element in an unsorted random linked-list of size n. 4) Inserting an item in a stack data-structure of size na. 5) Remove the last element of a long queue data-structure of size n