When analyzing recursive algorithms, which of the following best describes initial conditions?

Initial conditions express the complexity of an algorithm

Initial conditions express the number of times the basic operation runs during the first execution of the function.

Initial conditions represent the condition for the base case of a recursive function

Initial conditions express the number of times the basic operation executes when the base case is reached.