Q$2.$ Given an array of size n and a range $a,b.$ The task is to partition the array around the range such that array is divided into three parts.

All elements smaller than $"$a$"$ come first.

All elements in range $"$a to b$"$ come next.

All elements greater than $"$b$"$ appear in the end.

The individual elements of three sets can appear in any order. You are required to return the modified array.

give the answer in python programming language

Example:

Input:

Size of the array: $7$

Array: $0-14-68912$

$a,b$ range: $2,4$

Output:

Modified Array: $0-1-648129$