TRUE $1.$ Queries in Prolog correspond to conclusions derived in an argument in logic.

FALSE $2.$ If Prolog cannot prove the truth or falsehood of a goal, it $$eclares it to be true.

FAUSE $3.$ The maksimum number of arguments that a Prolog predicate $($functor$)$ can take is two $(2).$

TRUE $4.$ A recursive program necessarily includes a base component and a recursive component.

FALSE $5.$ An empty list in Prolog is denoted as $6.$plot the bode diagram for the following transfer function: g$($s$)=100(1+0\mathrm{.}2$s$)/($s$+5)($s$+10)$