Complete the following Haskell function definitions. Unless stated otherwise do not use library functions that are not in the Haskell standard prelude. This constraint is so that you gain practice in simple Haskell recursive programming. The Haskell 2010 standard prelude definition is available at https://www.haskell.org/onlinereport/haskell2010/haskellch9.htmlPlace all definitions in a single file. The file should compile without error messages in GHCI or Hugs. Submit just this text file electronically as directed on the course Study Desk page. Use the specified function names as your code will be tested by a Haskell function expecting that function name.The testing program may use many more test cases than the ones shown in the specification. So, please test your functions extensively to ensure that you maximise your marks. Part marks are available for all questions.1. [2 marks] Write a function remo :: Eq a => a -> [a] -> [a] that removes from a list (second argument) the first item that matches the value of the first argument. For example: remo 'a' "mamamaa" ⇒ "mmamaa" remo 1 [1,2,3,1] ⇒ [2,3,1]