3. Assume two memory locations are used for each node in a linked list. We start with an empty linked list and add, in order, nodes containing letters ,A, to 'E: (a) Draw a diagram showing the data and pointers of the resulting linked list, assuming the first node is at address 1000 b) Draw the diagram if the node containing 'B' is deleted c) Draw the diagram if 'F' is added between 'D' and 'E