Question $5(10\mathrm{.}0$ marks$)$

Algorithm design

a$)$ Given an n$-$element unsorted array $A$ of $n$ integers and an integer $k,$ describe

an algorithm, in pseudocodes, that rearranges the elements in A such that

all elements less than or equal to $k$ come before any elements large than $k.$

$(7\mathrm{.}0$ marks$)$

b$)$ What is the running time complexity of your algorithm? Explain your answer.

$(3\mathrm{.}0$ marks$)$