Prove the following assertion: For every game tree, the utility obtained by MAX usingminimax decisions against a suboptimal MIN will be never be lower than the utilityobtained playing against an optimal MIN. Can you come up with a game tree in whichMAX can do still better using a suboptimal strategy against a suboptimal MIN?

Which of the following statements is incorrect in relation to processes: while, strictly speaking, at any instant of time, the cpu is running only one process, in the course of 1 second, it may work on several of them, giving the illusion of parallelism a process is just an instance of an executing program, including the current values of the program counter, registers, and variables processes can be created when an operating system is booted, created by the user, or a running process can create children processes there is a master process, which when started can last forever, and is not killable