Could someone please answer numbers 3 through 6. I need these to be programmed in Haskell

l. Compute the nth Fibonacci number when Fi = F2 = 1 and Fn = Fn-1 + Fn-2 2. Write a function to reverse a string without using the built-in reverse method. 3 Wrte a function hat counts the occurrence of a specifiedcr i strng 4. Remove the leading spaces from a string without using trim or strip 5. Remove the trailing spaces from a string without using trim or strip 6. Remove both the leading and trailing spaces from a string without using trim or strip 4 Remove the leading spaces from a sring witini op