Assume that a Circular DHT is designed to keep track of where content chunks are stored in a P2P network. If it is designed to support two failures at a time, including the failure of two adjacent neighbors in the overlay network, then specify the steps taken for inserting a new peer into the DHT. What are the different peers that a given node has to keep track of? What is the procedure to be taken by a node when its two adjacent peers fail?