Using Python Programming only, write a recursive function 'allOnes' that takes in a list 'l' and an input size 'n', and returns a list consisting of 'n' ones. E.g. if n=3, the function will return [1, 1, 1].