1. Mark which topics are covered in the chapter that you were supposed to read for this week:

- stacks (Y/N):
- queues (Y/N):
- search (Y/N):
- number of computation steps (Y/N):

2. For a simple class Node

public class Node{ public int info; public Node link; }that describes a linked list of integers, write a method for computing the sum of all the integers from this list.