Please give java code for the below using quick sort and recursion. Please also provide details comments on each step and PSEUDOCODE

With the aid of a full code implementation, show how you would implement a solution to the Greatest Common Divisor (GCD) Problem. This simple mathematical problem is based on determining what is the largest Integer number that will divide into two given integers A \& B that are provided by a user. For example, in the case of A=8, and B=12, the GCD is 4 . You are asked to show the implementation of this for a selection of pairwise values for A and B which are given by two simple arrays: aValues[] bValues[] You are asked to generate a new array of GCD values for each pairing of aValues[i] and bValues[i] so that the result is recorded in gcdValues[i] Marks will be awarded for a correct solution, a clear and intuitive explanation of your implementation while also making use of advanced approaches such as recursion, and demonstrating a more efficient approach. Your solution should include commentary on the overall efficiency of your approach in your solution