Consider an array $A$ of elements $a_0,a_1,$dots,$a_n.$ Write an algorithm that creates a new array

where $a_0$ will be in position $k$ such that

$a_0{a}_i{a}_k$ for all $i$

Note that you are not asked $to$ sort the list, only that use $a_{0}as$ a pivot $to$ create two lists,

where the first list consists $of$ elements smaller than the pivot and the second list consists

$of$ elements greater than the pivot.

Describe $(pseudo$ code$)$ how you would parallelize this algorithm using OpenMP and show

what OpenMP features you would $be$ using.