2. a should be 1. (i) Write recursive function lastTrue : (int -> bool) -> int -> int such that lastTrue f n is the largest integer i in the range 0,...,n 1 such that f i is true. If there is no such i, then lastTrue x f n (ii) Using lastTrue, write a function lastEqual : 'a-> (int -> 'a) -> int -> int when 'a : equality such that lastEqual x f n is the largest i in 0,...,n-1 such that f i is equal to x. If there is no such i, then lastEqual x f n should be -1. (iii) Write recursive function first True : (int -> bool) -> int -> int such that firstTrue f n is the smallest integer i in the range 0,...,n 1 such that f i is true. If there is no such i, then firstTrue x f n should be -1. (iv) If lastTrue (fun x -> f x > f (x + 1)) 100 evaluates to -1, what can you say about f? How about if lastTrue f 100 firstTrue f 100 is true? = 2. a should be 1. (i) Write recursive function lastTrue : (int -> bool) -> int -> int such that lastTrue f n is the largest integer i in the range 0,...,n 1 such that f i is true. If there is no such i, then lastTrue x f n (ii) Using lastTrue, write a function lastEqual : 'a-> (int -> 'a) -> int -> int when 'a : equality such that lastEqual x f n is the largest i in 0,...,n-1 such that f i is equal to x. If there is no such i, then lastEqual x f n should be -1. (iii) Write recursive function first True : (int -> bool) -> int -> int such that firstTrue f n is the smallest integer i in the range 0,...,n 1 such that f i is true. If there is no such i, then firstTrue x f n should be -1. (iv) If lastTrue (fun x -> f x > f (x + 1)) 100 evaluates to -1, what can you say about f? How about if lastTrue f 100 firstTrue f 100 is true? =