Sequence the given process for checking whether a string is a palindrome or not, using a deque:
(A) Load the string into the deque.
(B) Continuously remove characters from both ends.
(C) Compare the characters.
(D) Determine if the string is a palindrome based on the comparisons.