Please Answer quickly

Write a function that takes a node pointer p and an integer value x. Insert the node with the integer data x just before the node with valid address p in the already existed singly linked list with head pointer. No loops allowed, losing points if used. Do not use any extra pointers. struct Node { int data; Node*next; }; The final result as the following: head