Write arecursive Haskell function (you cannot use existing functions) todo the following:
Write a functionlongestLowerString that takes a string list and returns the longeststring in the list that begins with a lowercase letter, or “” ifthere are no such strings. For example:
longestLowerString [“abc”, “Hello”, “car”, “apple”] ->”apple”
longestLowerString[“ABC”, “Hello”] -> “”
Solution