b$)$ Using only diagrams, illustrate how to perform the following array operations

on array $A.$

i$.$ Insert $18$ at index, $2$

$[4$marks$]$

ii$.$ Insert $15$ at index, $0$

iii. Delete element $21$

iv$.$ Delete the element at index $0$

A

c$)$ Using only diagrams and queue operations, demonstrate the difference

between a linear queue and a circular queue.

$[3$marks$]$

d$)$ Demonstrate the insertion of the following keys: $34,12,10,78,9,23,7,10,$

$35,28,18$ into a Binary Search Tree $($BST$).$

$(13)$ marks$]$

i$.$ Draw the BST after deleting $10$ and $34.$

QUESTION FOUR

a$)$ Compute the running time of the algorithm below.

b$)$ Explain why a stack is known as a LIFO data structure.