Write a recursive function that makes an alternating sequence of two objects. This function should take a postiveinteger and two objects as input. It should return a sequence that contains alternating copies of the two objects. Your function must work even when the input number is odd. Your code should not test whether the input number is odd or even. It should be sufficient to test whether the input number has reached one.

Preferably answer this question in racket, but I can use Java or Python answers as well