# Lisp Assignment

*******Do all parts******

There will`be four levels of grading for this…..first is pretty easy, not as many points, then they build.

1. Summation of a list, using recursion.
2. Using recursion finding the max value of consecutive numbers (you don’t have to do #1 to do this)
3. Doing part two and including lists inside of list as explained below
4. Doing Part 3 above and including the sub-list that added together

### To Do Part One (grading starts at 75%):

• Write a function that uses recursion and does a summation of a list of values sent in to the function.
• For example if your list is

-2, 4, -3, 5, -3, 1, -2, 3

### To Do Part Two (Grading starts at 90%):

Write a lisp program that takes a list of integer values and finds the highest summation adding consecutive numbers in the list.
For example if your list is

-2, 4, -3, 5, -3, 1, -2, 3

-2,
4, -3, 5, -3, 1, -2, 3

The answer might be one element, some elements like above, or all the elements.

Your program should give the highest sum.

### To Do Part Three (Grading starts at 95%):

• More points go to programs that can handle all the atoms in lists that have lists in the lists such as:

(-2, 4, (5, -6), 3, 6, 1)