2. Which of the following time complexity is the best in terms of Big-O notation: [O(2n+30), O(400 log n), O(n/100)]: (2 Points) O(2n+30) O(n/100) all are the same O(400 log n) 22. If an empty queue is implemented using array with length = 4, find the final value of front after applying the following operations: (enqueue('S'), enqueue('T'), dequeue(). enqueue('F'), dequeue(), enqueue('R'), enqueue('W')] (2 Points) 24. If we insert the following nodes in the following order (20, 55, 12, 33, 70)to empty Binary Search Tree then the Post-order traversal for the result Binary Search Tree is: (2 points) All answers are false 0 20, 12, 55, 33, 70 1 O 12, 33, 70, 55, 20 2 12, 20, 33, 55, 70