N C++ Let X x₁ x₂ , ..., x_n and Y y₁ y₂ ... y_m be two linked lists. Write an algorithm to merge mix the two lists together to obtain the linked list

Z x₁ y₁ x₂ y₂, ..., x_m y_m x_m+1, ... x_nif m n and

Z x₁ y₁ x₂ y₂, ..., x_n y_n y_n+1, ..., y_mif m > n.

No additional nodes may be used.

Implement mergeMix function by assuming it is a friend function of LinkedList class.

LinkedList mergeMix(LinkedList x, LinkedList y)