LISP programming language question.

Suppose that the equal_lists function is called with the lists ((A B ) C (D E)) and ((A B ) C (D E)) as the arguments. How many calls of equal_lists will be performed altogether, including the original call and all recursive calls?

: Lisp Example function i The following code defines a Lisp predicate function i that takes two lists as arguments and returns True : if the two lists are equal, and NIL (false) otherwise (DEFUN equal_lists (lis1 lis2) (COND (ATOM lisl) (EQ lisl lis2)) (ATOM lis2) NIL) ((equal-lists (CAR11s1) (CAR11s2)) (equal_lists (CDR lis1) (CDR lis2))) (T NIL)