Question 44 Not yet enswered Marked out or 1.00 P Rlag question Fill in the blank with all that apply An algorithm must Select one or more: a. use integers b. take less than 100 steps c. have a finite description d. be expressible in a language that can be understood by a computer e. have effective individual steps Question 45 Not yet enswered Marked out or 1.00 Consider the algorithm that Hansel and Gretel used to find home using the pebbles. If we remove the condition in the algorithm to find only nonvisited pebbles, a computation could slip into moving back-and-forth between two pebbles. What is the problem with this condition? Select one: O a. it can't be expressed in a language that a computer can understand O b. it does doesn't terminate O c. each of its individual steps are no effective Flag question d. it is not a computation Question 46 Not yet answered Marked out of 1.00 Much of the power and impact of algorithms comes from the fact that one algorithm gives rise to many computations. Select one O True P Flag questionFalse Question 47 Not yet answered Marked out of 1.00 P Flag question The key to providing controlled variability in algorithms is to employ one or more placeholders, called Select one O a. methods o b. numbers O c. parameters O d. polynomials e. functions