Sketch out a recursive algorithm for detecting a palindrome. A palindrome is a word that is the same when read left to right and it is read right to left. Example: "racecar", "mom". Can be pseudo code or a language of your choice

 

Explain Haskell's Type system (Strong,weak,static,dynamic) and give an example in Haskell to show each that you describe.

 

Figure out what is a good use case for a logic language? Give a concrete example (supply code if needed)