What is the time complexity of searching for an element in an unsorted array? In an

unsorted singly$-$linked list? In a sorted array? In a sorted singly$-$linked list? Consider the

most ecient algorithm for each search.

A$.$ unsorted array: $($log n$),$ unsorted linked list: $($n$),$ sorted array: $($log n$),$

sorted linked list: $($log n$)$

B$.$ unsorted array: $($log n$),$ unsorted linked list: $($n$),$ sorted array: $($log n$),$

sorted linked list: $($n$)$

c$.$ unsorted array: $($n$),$ unsorted linked list: $($n$),$ sorted array: $($log n$),$ sorted

linked list: $($log n$)$

D$.$ unsorted array: $($n$),$ unsorted linked list: $($n$),$ sorted array: $($log n$),$ sorted

linked list: $($n$)$