Q3 3 Points Q3.1 1 Point Which of the following Symbol Table ADT implementations is (are) the most efficient (in the worst case) for an application that uses many additional inserts and few searches? Select the first correct answer Sorted Array Unsorted Array Sorted Linked List Unsorted Linked List binary search tree (BST) O Red-black BST Save Answer Q3.2 O Points Which of the following Symbol Table ADT implementations is (are) the most efficient in the worst case) for an application that uses few additional inserts but many searches? Select the first correct answer. Sorted Array Unsorted Array Sorted Linked List Unsorted Linked List O binary search tree (BST) O Red-black BST Q3.3 2 Points Which of the following Symbol Table ADT implementations is (are) the most efficient (in the worst case) for an application that uses as many additional inserts as searches? Select the first correct answer Sorted Array Unsorted Array Sorted Linked List Unsorted Linked List binary search tree (BST) O Red-black BST