Develop well-documented pseudo code that accepts an array of integers, A, of any size, then finds and removes all duplicate values in the array. For instance, given an array A as shown below: [22, 61,-10, 61, 10, 9,9, 21, 35, 22,-10, 19, 5, 77, 5, 92, 85, 21, 35, 12, 9, 61), your code should find and remove all duplicate values, resulting in the array looking "exactly" as follows: [22, 61,-10, 10, 9, 21, 35, 19, 5, 77, 92, 85, 35, 121. Notice the change of size. Also keep in mind that this is just an example; your solution must not refer to this particular example; rather it must work for any given array. Additionally, you are only allowed to use Stacks, Queues, or Double-ended Queues (DQ) to support your solution, if needed. You are NOT allowed to use any other ADTs. a. Briefly justify the motive(s) behind your algorithm. b. What is the Big-O complexity of your solution? Explain clearly how you obtained such complexity. c. What is the Big-2 complexity of your solution? Explain clearly how you obtained such complexity. d. What is the Big-O space complexity of your solution