[Solved]6 3 Points Write Function Longest String Takes String List Returns Longest String List Lst Q37184913

In Haskell: functions must be recursively

6. (3 points) Write a function longest String that takes a string list and returns the longest string in the list. If the lst is empty, return “” (i.e., an empty string). In the case of a tie, return the string closest to the beginning of the list longestString”abc”, “Hello”, “car, “apple”] -> “hello” longestString [->”” Show transcribed image text 6. (3 points) Write a function longest String that takes a string list and returns the longest string in the list. If the lst is empty, return “” (i.e., an empty string). In the case of a tie, return the string closest to the beginning of the list longestString”abc”, “Hello”, “car, “apple”] -> “hello” longestString [->””

Expert Answer

---

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