total :: (Int -> Int) -> (Int -> Int)so that total f n gives
f 0 + f 1 + f 2 + ... + f n
filterFirst :: (a -> Bool) -> [a] -> [a}so that filterFirst p xs removes the first element of xs that does not have the property p.
filterLast :: (a -> Bool) -> [a] -> [a}so that filterLast p xs removes the last occurrence of element of xs that does not have the property p. How could you define it using filterFirst?
Please format and document your program source code appropriately. (All of the above functions should be defined in the same file.)
Test your programs appropriately and thoroughly.
When this assignment is complete, submit a paper listing of your program source code and the screen outputs from executing the program. Be sure that all items submitted are clearly labeled with your name and the assignment number.
Also submit your program source code using MESH at URL http://www.cherry.cs.olemiss.edu/mesh/. Your username and password for that system was given to you earlier.
UP to CSCI 555 assignments document?