How do you perform a recursion on the rest of the first of a list? (Racket)?

You're exactly right that the code (rest (first l1)) produces the rest of the first of the list. Specifically: (define l1 (list (list (list 1 1) (list 2 3) (list 7 8)) (list (list 2) (list 3 4 5)))) (rest (first l1)) produces (list (list 2 3) (list 7 8)) It's true that you can't add the elements of this list together, because they're not numbers Does this answer your question?

You're exactly right that the code (rest (first l1)) produces the rest of the first of the list. Specifically: (define l1 (list (list (list 1 1) (list 2 3) (list 7 8)) (list (list 2) (list 3 4 5)))) (rest (first l1)) produces (list (list 2 3) (list 7 8)) It's true that you can't add the elements of this list together, because they're not numbers. Does this answer your question?

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.