use R5RS solve Part C,Thank u very much!

Part C: Use car and cdr to write a recursive function that returns a naive count of the items in the list. Naive here means we won't count items contained in sublists, sublists only count as one item. This function should be named list-length? and take a list as a parameter. (list-length? '(a b c d)) 4 (list-length? '(a (b c) d)) 3 HINT: Helper Function Pattern goes a LONG way here. Part C: Use car and cdr to write a recursive function that returns a naive count of the items in the list. Naive here means we won't count items contained in sublists, sublists only count as one item. This function should be named list-length? and take a list as a parameter. (list-length? '(a b c d)) 4 (list-length? '(a (b c) d)) 3 HINT: Helper Function Pattern goes a LONG way here