This question will deal with Red$-$Black Binary Search Tree. Need detailed explanation for the following two parts:

a$.$ Develop a pseudo code to use Red$-$Black to sort an array in decreasing order, at the same time remove those duplicated elements and negative elements. For

example, given an input array $[18,13,-7,-9,4,2,18,6,4,10,4,-7],$ the output

should be $[18,13,10,6,4,2]$

b$.$ Discuss the time complexity and storage complexity of your code

Show your work