[Solved]7 3 Points Write Function Longestlowerstring Takes String List Returns Longest String List Q37184807

In Haskell: functions must be recursively.

7. (3 points) Write a function longestLowerString that takes a string list and returns the longest string in the list that begins with a lowercase letter, or if there are no such strings longestLowerString [ “abc”, “Hello”, “car”, “apple”- “apple” longestLowerString [“ABC, “Hello”] -> “” IF II Show transcribed image text 7. (3 points) Write a function longestLowerString that takes a string list and returns the longest string in the list that begins with a lowercase letter, or if there are no such strings longestLowerString [ “abc”, “Hello”, “car”, “apple”- “apple” longestLowerString [“ABC, “Hello”] -> “” IF II

Expert Answer

---

Answer to 7. (3 points) Write a function longestLowerString that takes a string list and returns the longest string in the list th… . . .