Theory of Programming Language class

a. Consider the following Haskell code defining the function odds, which is defined using the higher-order function filter: odds :: [Integer] -> [Integer] odds 1s= filter foo 1s Given a list of integers Is, odds of /s should evaluate to the list of odd integers in /s. Define the function foo needed to make this happen. b. Consider the following Haskell code defining the function mymaximum, which is defined using the higher-order function foldr1: mymaximum :: (Ord a) [ a] a mymaximum 1s= foldr1 bar 1s Given a list of numbers /s, mymaximum of /s should evaluate to a maximum element in /s. Define the function bar needed to make this happen