$($b$)(15$ points$)$ Implement in pseudocode the Remove$($i$)$ operation that removes the node at index i in linear time.

$($c$)(10$ points$)$ Given a link to a node old, is it possible to implement a constant time operation Remove$($old$)$ similar to the one discussed in class for the usual implementation of doubly$-$linked lists that contain two links per node? Why or why not?

With regards to link arithmetic, assume that the NULL link is represented by an all zero bitstring. $[$Hint: Remember that for any two bitstrings a and b$,$ we have $($a XOR b$)$ XOR b $=$ a$.]$