Question on linked list

Let ‘L’ be a singly linked list containing ‘n’ nodes having ‘n’ characters as their data item. Write an algorithm to merge the node with vowel character with neighboring nodes(any one side). Use only linked list operations

Example input : A → B-> E → I → K → U → P

Expected output : AB → EIK → UP (by adding vowels with right side node)