An algorithm that works by always selectin information is known as a recursive algorithm uninformed algorithmc. greedy algorithm d$.$polynomial algorithme, risk averse algorithm$17)$Which of these have been proposed as ways to measure the performarce intelligence?a$,$Acting rationally $($for example, planning based on information from the envireb. Acting humanly $($for example, interacting via tent$)$c$.$ Thinking humanly $($using human reasoning processes$)$ d$.$Thinking rationally $($applying formal logic, learning$)$e$,$All of the above$18)19)$One method of constructing a solution is to generate a state a lite bi$,21.3$ time sure that each new component added satisfies all constraints that acoly. What do no such 'next step' can be found?.try making random changes until we find something that worksb. backtrack a small amount, until another path is possible, and try another optionc. remove some of the constraints and recompute the domaind. throw out the entire partial solution and start overe. take the configurations of all previous nodes and place them on a rejection list$1$Searle's Chinese Room is an objection to the Turing Test based on the idea ta$.$ truly understanding natural language can never be reduced to an algorithmb. given a large enough database, we could store a plausible answer to any qc$.$ without aesthetic appreciation, true intelligence isn't possibled. a system can produce a response mechanically without understanding hie. None of the above