2b

Write the following function in OCAML

Implement a recursive OCaml function ascending : int -> int list, which accepts an integer n as input (again, assume n 0), and returns a list of integers from 0 to n in ascending order.

Started Code:

let ascending (n : int) : int list =