climbUp(n)/climbDownUp(n) These two functions each return an array, which contains a sequence of integers;if n=0, then they return an empty array, and if n=1 they return a single value [1]. However, if n is larger, they return a sequence that counts through the numbers 1 to n. In climbUp, the sequence simply counts up; in climbDownUp0, it starts at n, counts down to 1, and then counts back up ton. For example, ifn=4, the n climbUpOwill return[1,2,3,4], while climbDownUpOwill return[4,3,2,1,2,3,4]