Rearrange Linked List

Given a linked list, rearrange it such that all nodes with values less than a value x come before nodes with values greater than or equal to x. The original relative order of the nodes in each partition should be preserved. Input Format: - The first line contains the integer n, the number of nodes in the linked list. - The second line contains n integers, representing the values of the nodes. - The third line contains the integer x. Output Format: - Print the rearranged linked list in a single line, with elements separated by spaces. Example: Input: 5 3 5 8 5 10 5 Output: 3 5 5 8 10