The table below gives portion of a linked list. Each list entry spans two consecutive address locations - the first contains a letter of the alphabet, and the second contains a pointer to the next list entry.

Header 32
Address Contents
30 J
31 38
32 B
33 30
34 X
35 46
36 N
37 40
38 K
39 36
40 P
41 34

I need to figure how to alter the pointers in the table so that the letter N is skipped over and is no longer accessed in the list.

Then how do I replace the letter N with the letter G and alter the pointers so that the new letter appears in the list in its proper place in alphabetical order?

Please explain the logic to how you arrive at the answers.