PYTHON 3 LANGUAGE , LINKED LIST WITH RECURSION ONLY

Define a recursive function named alternate_r. You may not create/use any Python data structures in your code: use linked list processing only: use no looping, local variables, etc. Hint: see the recursive code for appending a value at the end of a linked list; of course, try to use the 3 proof rules to help synthesize your code.

a = list_to_ll(['a', 'b', 'c',]) and b = list_to_ll([1,2,3,4,5])

alternate_r(a,b) returns a->1->b->2->c->3->4->5->None and alternate_r(b,a) returns 1->a->2->b->3- >c->4->5->None.

def alternate_r(ll1 : LN, ll2 : LN) -> LN: pass