Question 4: List processing Consider the following OCaml function definitions. let isupper c = Char, code c >= Char, code ,A, && Char, code c false x: :xs - isupper x II someupper xs Using the definition above, show using induction that someupper (11 @ 12) = someupper 11 ll someupper 12 Your proof must explicitly and clearly indicate the base case you prove, the inductive case you prove and what the inductive hypothesis provides in the proof. Each step in your proof must be accompanied by a justification describing why that step could be taken. 4-bin.dmg