nev Tail + Circular Linked List In-Class Exercises 1. Write Algorithm for addAtPos (int pos, E value) that takes position and a value as inputs and add a new node in that position 2. Write Algorithm for deleteAtPos (int pos) that takes a position as input and delete the node in that position. Februa