1.1) The function app, defined by: app f [x, y] = [fx, fy], gives eg: app (* 2) [3,4] = [6,8] .Define note that does it same as app on any list. 1.2) Use foldr to define what meets the equation: fapp f xs = lapp f xs. 1.3) Use foldr to define function smsq n = 1 ^ 2 + 2 ^ 2 + ... + n ^ 2. 1.4) Define tail recursive function longest :: [[a]] -> [[a]] which picks all longest lists from the list of lists, eg longest ["abcd", "ab", "1234", "asd" ] = ["abcd", "1234"].