What two things can you prove about a recursive solution using mathematical induction? that a recursive algorithm is efficient that a recursive algorithm performs an enoumous amount of work that a recursive algorithm is efficient that a recursive algorithm performs the same amount of work as the repetitive algorithm that a recursive algorithm cannot be used to solve the problem in question that a recursive algorithm performs an incorrect amount of work that a recursive algorithm is correct that a recursive algorithm performs a certain amount of work Logic that determies whether a string is in a languange is know as a(n) recognition grammar syntax diagram language grammar recognition algorithm