Design and implement a recursive function, which generates all length n strings of 0's and 1's for a given non negative integer n. The function must have n as the only parameter and the function must return a list containing all length n strings of 0's and 1's (in order).

Outputs with function name binaryOutput:

binaryOutput(2) => ["00", "01", "10", "11"]

binaryOutput(3) => ["000", "001", "010", "011", "100", "101", "110", "111"]

Function has to be recursive and can only take n as a parameter.