1. (8 points) Show by hand how Haskell evaluates: ord_inlist 2 [1,4,8,11,22] which checks whether an element occurs in an ordered list. The definition of ord list is as follows: foldr:: (a->b->b) ->b->[a]-> foldr fb [] = b foldr fb (x:xs) fx (foldr fb xs) ord_inlist:: Ord a => a => [a] -> Bool ord_inlist x = foldr (la b -> a==x || (x>=a && b)) False where (as in the Prelude): (ID:: Bool->Bool->Bool (11) False b = b (11) True (&& ) :: Bool->Bool->Bool (&&) True b = b (&& ) False