Please answer part a of the qestion!!!!!!

Develop a 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 as follows: [22, 61,-10, 10, 9, 21, 35, 19, 5, 77, 92, 85, 35, 12] Notice that this is just an example and your solution should be applied to any given array. Additionally, you are only allowed to use Stacks, Queues, or Double-ended Queues (DQ) to design your solution, if needed. a. Briefly justify the motive(s) behind your solution design (choice of the algorithm and the data structure)