A recursive computation of the size of a list can work as follows:
A) set a local counter to zero;loop through the list,incrementing the counter by one at each element of the list;return the counter
B) recursively compute the size of the tail,add one,and return the result
C) if the list is not empty,recursively compute the size of its tail,add one,and return the result
D) if the list is empty,return zero;otherwise,recursively compute the size of the tail,add one,and return the result

Question

Quizplus · Accepted Answer

A recursive computation of the size of a list involves checking if the list is empty and returning zero if it is. Otherwise, it computes the size of the tail recursively, adds one, and returns the result.

A Recursive Computation of the Size of a List Can