Define the following functions in Scheme AND in F# (or plain Ocaml)

1. Define a function called cube that resolves to the cube of the input parameter. Example: (cube 5) resolves to 125.?

2. Define a function called removeDups that accepts a function and a list (which you can assume is already sorted) and resolves to a new list with the duplicates removed. Example: (removeDups '(1 1 2 3 4 4 5 8 8 8 )) resolves to (1 2 3 4 5 8).