For this Question: Given a list of size 2*N in the form as x<sub>1</sub>->x<sub>2</sub>->x<sub>3</sub>.... x<sub>n</sub>, y<sub>1</sub>->y<sub>2</sub>->y<sub>3</sub>,.... y<sub>n</sub>, Your task is to shuffle the list in the form given as x<sub>1</sub>->y<sub>1</sub>->x<sub>2</sub>->y<sub>2</sub>,.... x<sub>n</sub>,->y<sub>n</sub>.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>shuffle()</b> that takes the head node of the linked lists as a parameter.

Constraints:-
1 &le; N &le; 1000Return the head of the modified list.Sample Input:-
3
1 2 3 4 5 6

Sample Output:-
1 4 2 5 3 6

Explanation:
1-> 4-> 2-> 5-> 3-> 6
, I have written this Solution Code: 
def shuffle(arr,size):
    l=[]
    for i in range(size):
        print(arr[i],end=" ")
        print(arr[size+i],end=" ")







size = int(input())

arr= list(map(int,input().rstrip().split()))

shuffle(arr,size), In this Programming Language: Python, Now tell me if this Code is compilable or not?