$(2)(50$ points$)$

You are given an array of integers and an index $x.$

Without sorting Re$-$arrange the array as below:

elements less than array $x,$ followed by elements equal to array $x,$ followed by elements greater than array $x$

Array, $a=[3,5,2,6,8,4,4,6,4,4,3]$ and $x=5$

Write a Python Program that re$-$arranges the above given array exactly as shown below without using a sorting routine of any kind output array $=[3,2,3,4,4,4,4,5,6,8,6]$

Here You are Not allowed to use an extra array to solve the problem.

Hint : Keep three pointers to track boundaries. Low tracks elements less than a $x,$ Mid tracks elements cqual to a $x,$ and High tracks elements greater $a[x].$ Go through the array and place the numbers in the correct boundary.