Continuing from the previous challenge, we provide you another opportunity to create a recursive function to solve a problem.
</section>
## Instructions
<sectionid='instructions'>
We have defined a function called <code>countdown</code> with two parameters. The function should take an array in the <code>myArray</code> parameter and append the numbers n through 1 based on the <code>n</code> parameter.
For example, calling this function with <code>n = 5</code> will pad the array with the numbers <code>[5, 4, 3, 2, 1]</code> inside of it.
Your function must use recursion by calling itself and must not use loops of any kind.
</section>
## Tests
<sectionid='tests'>
``` yml
tests:
- text: After calling <code>countdown(myArray, -1)</code>, myArray should be empty.
testString: assert.isEmpty(padArray([], -1));
- text: After calling <code>countdown(myArray, 10)</code>, myArray should contain <code>[10, 9, 8, 7, 6, 5, 4, 3, 2, 1]</code>
- text: Your code should not rely on any kind of loops (<code>for</code> or <code>while</code> or higher order functions such as <code>forEach</code>, <code>map</code>, <code>filter</code>, or <code>reduce</code>.).