Q$3\mathrm{.}1$

$1$ Point

Which data structure$($s$)$ is$($are$)$ the most efficient $($in the worst case$)$ for adding $n>>1$ items? $($mark all correct answers$)$:

Unsorted Array

Sorted Linked List

Sorted Array

Unsorted Linked List

Binary Search Tree $($BST$)$