(***********************************)
(* Part 1: Non-Recursive Functions *)
(***********************************)
let rev_tup tup = failwith “unimplemented”
let abs x = failwith “unimplemented”
let area x y = failwith “unimplemented”
let volume x y = failwith “unimplemented”
(*******************************)
(* Part 2: Recursive Functions *)
(*******************************)
let rec fibonacci n = failwith “unimplemented”
let rec pow x y = failwith “unimplemented”
let rec log x y = failwith “unimplemented”
let rec is_prime x = failwith “unimplemented”
let rec next_prime x = failwith “unimplemented”
(*****************)
(* Part 3: Lists *)
(*****************)
let rec get idx lst = failwith “unimplemented”
let larger lst1 lst2 = failwith “unimplemented”
let reverse lst = failwith “unimplemented”
let rec combine lst1 lst2 = failwith “unimplemented”
let rec rotate shift lst = failwith “unimplemented”
let rec is_palindrome lst = failwith “unimplemented”