For this chapter, do one of the following. Do all questions under one bullet, but do not do more than one bullet.

• Answer all parts of question 5.6 of Chapter 5 of Hennessy & Patterson, 6^th
• Answer all parts of question 5.10.
• Devise wait-free implementations to add an item to the tail of a linked list using LL + SC and to remove an item from the tail of a linked list. Ideally, this should be consistent with the implementations of adding to and removing from the head of the same list, as shown in class and in the lecture notes. Note: this is particularly challenging!

Individual or team project

You may work on this assignment as individuals or in two-person teams. See below for team information.

You may consult with your classmates or others on the general nature of the assignment, but you must prepare and write your solution yourself, in your own words.

If you do not have time to finish this assignment please turn in what you have completed, along with a statement of how much time you spent on the assignment and an explanation of where you had difficulty.