Implement the function from the previous problem as a tail recursive function. Trace the recursive process to illustrate how the algorithm works to solve this problem. 3. A 2D image of a chessboard of queens is stored as a 1D array where every index is a row, every value a column. Thus, every index, value pair in the 1D array is a row, column coordinate of a queen. Implement a print function which will accept this 1D array by parameter and print the corresponding 2D image where Q represents a queen and . represents an empty square. What is the time complexity of the solution? Example Output The 1D array {3,0,1,2} will print the image: . . . Q Q . . . . Q . . . . Q .