Using your typing rules with an assumed Applied Lambda Calculus. Give proofs (these are very short) of the types of the previous two examples. That is, a. Given (true, 1) prove that (true, 1).fst results in a Boolean type and (true 1).snd results in a Natural Number type
b. Given Isucc 4, if false then true else false).fst, prove this results in a Natural Number type.