Given the head of a linked list, your task is to check whether the linked list is a palindrome or not. Return TRUE if the linked list is a palindrome; otherwise, return FALSE.

Note: The original structure of the linked list must remain unchanged before and after the checking process.

Constraints:

Let n be the number of nodes in a linked list.

• $1 \leq$ n $\leq 500$

• $0 \leq$ Node.value $\leq 9$ ...