diagram bo show bow array ar $r$ in soried in Nobending order uning Mergesurt

Alporithm:

$($b$)$ The following frut names are imserted to the hash table from left fo fiyht.

Table $1\mathrm{.}0$ ahows the hash value for each freit name in a hash table. Drow a

habh table based on this Table $1\mathrm{.}0.$ Use chaining to solve collision when it

occurs. Show the NULL.L value in the hash table.

Mango, Banana, Orange, Apple, Grupe, Durian, Jackfruit, Mangouteen

Table $1\mathrm{.}0$: Hash Table Value

$(6$ marks$)$

$($c$)$ The function below is used to print all the nodes in a linked list. Derive the

Big$-$O notation to print a list using the function below. Explain the steps on

how to calculate the time complexity for the function and derivation of the

Big$-$O notation.

Assume that the size $()$ do not require any step and the get $()$ will require $n$

steps where $n$ is the size of the linked list. The cout and return statements

also do not require any step to perform.help