Insert GCD Nodes in Linked List

You're given a linked list where each node contains an integer value. Your task is to modify the list by inserting a new node between every pair of adjacent nodes. This new node should contain a value equal to the greatest common divisor (GCD) of the values of the adjacent nodes.