The algorithm Seq(n) is shown below. What is the number of recursive call in the execution of Seq(3)? Seq(n) { if (n = 1) return 1 else if (n = 2) return 2 else if (n = 3) return 3 else return (Seq(n-3) Seq(n-2)) } Select one: a. 3 O b. 1 Oc. 0 O d. 2