state on eaeh statement is True of Fatse:

The ultimate goal of Al is to design systems that can think and act like humans.

TF

A simple breadth$-$first search will always find the shortest solution if one exists and it is of finite length.

$TE$

The Turing test is not evaluates a computer system's ability to act rationally.

TF

Heuristics are used to transfer a NP$-$hard problem to polynomial.

$T(E)$

An agent consists of an architecture and algorithm.