If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue?

• A. Neither of the pointers change
• B. Only front pointer changes
• C. Only rear pointer changes
• D. Both of the pointers changes