Implement the following in Haskell. Please follow the specification below which also includes a sample run

maxNew maxNew: [Int] -> [Int] Maybe Int Given a list of integers (xs), and a list of old integers (olds), find and return Just the largest integer in xs that isn't also in olds. When there is no such number, return Nothing. Homework3> maxNew [1,2,3,4,5,6] [5,6 Just 4 Homework3> maxNew [1,5,3,4,6,2,4,4] [5,6] Just 4 *Homework3> maxNew [-5,-4,-3] [-4 Just (-3) Homework3> maxNew [1,2,3] 11,2,31 Nothing *Homework3> maxNew [1,1,1,1,3,3,3,31 [1,3] Nothing