How can I solve this problem by using recursion?  package ArrayProblem; public class RecursiveArray { private static String[][] data = { {"A", "B"}, {"1", "2"}, {"XX","YY","ZZ"} }; public static void main(String[] args) { for(int i=0; i 
 
 
} 
 
 
  Given the definition of a 2D array such as follows: String[][] data "A", "B"), t"1", "2"), H"XX", "YY", "ZZ"} Write a recursive program that outputs all combinations of each subarray in order. In the previous example, the desired output might look like the following: A 1 XX A 1 YY A 1 ZZ A 2 XX A 2 YY A 2 ZZ B 1 XX B 1 YY B 1 ZZ B 2 XX B 2 YY B 2 ZZ