The recursive Fibonacci function is inefficient becausea) it does many repeated computationsb) recursion is inherently inefficient compared to iterationc) calculating Fibonacci numbers is intractabled) fibbing is morally wrong

Computer Science Python programming language Please help me with these Review questions with as much explanation as possible. I really need to understand this

Recursive algorithm always gives cleaner code with less cost.  Group of answer choices True False

python def factorial(n):pass # replace this line with your lines of recursive codedef sum_recursively(n):pass # replace this line with your lines of recursive codedef sumlist_recursively(l):pass # replace this line with your lines of recursive codedef reverse_recursively(l):pass # replace this line with your lines of recursive code#EXTRA CREDITdef multiply_recursively(n, m):pass # replace this line with your lines of recursive code

The ____ of a recursive algorithm is the part that continues the recursive calls.

1.)I have to recursive with python language and was asked to do a buy 2 get 1 free where you have some amount of money(x) each item costs a given amount(y), for each 2 item you get 1 free, builda recursive solution to find out how many items you can buy for x amount of money. 2.) Buy M, get N free Then alter your first answer to allow for the user to enter any M and N for how many you need to buy to get free items