Given an unsorted array write the pseudo code to sort it and find a specific clement $x$

a$.$ Find $($array$,x)$

$//$ first sort the array

$//$ search for element $x$ using binary search $[7$ Marks$]$

Given the following stack $A=\{29,18,10,15,20,9,5,13,2,4,15\}$

Create a queue by taking the elements from the top of the stack and adding them to the queue. $[4$ Marks$]$

What are the worst$-$case, average$-$case, and best$-$case complexities of insertionsort, bubble$-$sort, merge$-$sort, and quicksort? $[5$ Marks$]$