Consider the following recursive function for n 1: Algorithm 1 int recurseFunc(int n) If n == == 0, return 1. If n = 1, return 1. i=0 while in do j=0 while j