While working on a project, you determine that you require a collection ADT to/from which you can randomly insert, access, and remove items and guarantees a sublinear time complexity (better than O(n) ) on all such operations in the worst case. Which of the following ADTs would service this role most efficiently? Heap Singly Linked List None of the other answers meet the stated requirements. Ordered Binary Tree Arrayed Binary Tree Linked m-ary Tree Doubly Linked List AVL Tree Question 2 A test that checks whether a heap ADT has retained its heap property after an insertion into a heap already containing many items is an example of a test case generated with which method? White-box testing Black-box testing