Description: Implement doubly linked list. Your code should implement functions for: Appending to the end of list - a . Inserting to specific position - i value index Removing item by value - r value . Removing item by index - d index Displaying items in list - p . Printing length of list - 1 Printing items starting from tail - t . Reversing items in list - v Erasing all items in list - e Use 'x' to exit from program. struct Node int data; Node . next ; Node . prev: } . head; Example Input Output A A 2 A 4 D 1234 1 4 r 3 r8 Not found P 124 i 10 1 i 20 2 i 30 3 P 10 20 30 1 2 4 d 1 d 1 p 30 1 2 4\f