How do I solve this problem only using a simple recursion program

A. create a method to read your method

B. create a method and pass a parameter (array, row, column)

7. Given the definition of a 2D array such as the following: String[] [] data = { {"A", "B"} {"1","2"}, {"XX", "YY", "ZZ"} 11.3 Graphics Supplement write a recursive program that outputs all combinations of each subarray in order. In the above example, the desired output (although it doesn't have to be in this order) is: 877 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 Your program should work with arbitrarily sized arrays in either dimension. For example, the following data: String[] [] data = { {"A"}, {"1"}, {"2"}, {"XX", "YY"} }; should output: A 1 2 XX A 1 2 YY tod hv Lewis Carroll in 1877. The idea is rivina at