Let us assume that we have an application that performs many retrievals as well as many insertions and deletions on a table. Which implementation is more appropriate for this application? a sorted array-based implementation an unsorted array-based implementation a sorted linked-list implementation a binary search tree implementation (with O(logn) height) Let us assume that we have an application that inserts data items into a table. After all data items are inserted, the table is traversed in no particular order. The application does not perform any retrieval and deletion operations. We know the size of the table. Which implementation is more appropriate for this application? a sorted pointer-based implementation an unsorted pointer-based implementation a sorted array-based implementation an unsorted array-based implementation a binary search tree implementation Let us assume that we have an application that performs many retrievals on a table, but few insertions and deletions. We do not know the size of the table. Which implementation is more appropriate for this application? a sorted array-based implementation an unsorted array-based implementation a binary search tree implementation