i$.$ Write a deletion algorithm for the circular doubly linked list P to enable the

deletion of node A$.$

ii$.$ Write an insertion algorithm for the circular doubly linked list P to enable the

insertion of node D$.($a$)$ A circular doubly linked list $P$ with three elements is logically represented in Figure

$2\mathrm{.}1.$ The node structure of a doubly linked list is as in Figure $2\mathrm{.}2.$

$[$Satu senarai berpaut berganda bulat P dengan tiga elemen diwakili secara logik di dalam Rajah $2\mathrm{.}1.$

Struktur nod satu senarai berpaut berganda adalah seperti di dalam Rajah $2\mathrm{.}2.]$

Figure $2\mathrm{.}1$

$[$Rajah $2\mathrm{.}1]$

Figure $2\mathrm{.}2$

$[$Rajah $2\mathrm{.}2]$