Use Python Language, Use recursion and pass only one parameter to the function

Give an explanation of the code.

Another hint for Assignment 2, Q1 Stephen Anthony posted on Jan 27, 2021 5:47 PM Consider the patterns in the data: 000 -> O + (00, 01, 10, 11) 001 010 011 100 -> 1 + (00, 01, 10, 11) 101 110 111 00 -> 0+ (0, 1) 01 10 -> 1 + (0, 1) 11 9 -> o 1 -> 1 Notice how each step is essentially the same problem, just a little smaller? This is a defining characteristic of recursion. 1. Generating Strings [75%] Design and implement a recursive function called generateInOrder(), which generates all length-n strings of O's and 1's, for a given non- negative integer n, in order from smallest to largest. Your function must have n as the only parameter and must return a list containing all length-n strings of O's and 1's (in order). Test your function with a few different values of n. Output examples: generateInOrder(2) ["00","01","10", "11"] generateInOrder(3) ["000","001","010", "011", "100", "101", "110", "111"] o Note: The sequences above are in order, since if you consider them as binary numbers, they start at 0 and increment each time