General Pasts Fil Final Data Struct more 16. 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) 12, 33, 70, 55, 20 12, 20, 33, 55, 70 All answers are false 20. 12, 55, 33, 70 17. If an empty queue is implemented using array with length = 3, find the final value of rear after applying the following operationsseng eers enqueue dequeue enqueue Fl. de queued) enquere(R) enqueue (2. Points)