$($b$)$ Search for character $\text{'}t\text{'}$ in the array below using binary search method and

provide the values for lower, mid and upper for every search step in a table.

$($c$)$ Table below shows the operations that applied on sorted circular doubly linked

list and unsorted linked list. Assume that all items are sorted in ascending

order, identify the complexity in Big$-$O notation for the worst case scenario in

the table below.

$($d$)$ Compare the complexity for the best and worst case scenario when perform

searching using Binary Search and search in a Hash Table.help