Question: 5. Write a recursive Haskell function strings :: Integer -> Char -> [String] such that strings n ch returns a list containing 'n' strings, the
5. Write a recursive Haskell function
strings :: Integer -> Char -> [String]
such that "strings n ch" returns a list containing 'n' strings, the "ith" of which contains (n i + 1) copies of ch.
(If n is less than or equal to zero, the function returns the empty list.)
For example,strings 5 A returns ["AAAAA","AAAA","AAA","AA","A"].
I can't use ++
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
