design/algorithm analysis - please answer as many as you can. Thank you!

Question 6 10 pts Select all the statements below which are TRUE Let L be a singly-linked list with n elements, sorted in increasing order. Then inserting an element x takes (n) in the worst-case Inserting a value into a queue 11.n] takes (n) in the worst-case. ift(n):0(g(n)), then f(n)=0(g(n)). For any min-heap A[Lin], the second order statistics is always A[2]. RANDOMIZED-SELECT is using divide-and-conquer. In each step, the algorithm is recursing on two subproblems of size n/2. Counting sort is stable