Answer:
Explanation:
The following code is written in Java. It is a method that calculates the square root of a number as requested. The method first checks with an IF statement if the parameter value is a positive number and then calculates the square root and prints it to the screen. Otherwise, it prints Number must not be negative. A test case has been provided in the main method and the output can be seen in the attached image below.
import java.util.Scanner;
class Brainly {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
System.out.print("Enter a number of type double to calculate square root:");
double num = in.nextDouble();
rootPositive(num);
}
public static void rootPositive(double num) {
if (num > 0) {
System.out.println(Math.sqrt(num));
} else {
System.out.println("Number must not be negative.");
}
}
}
<span>B) storing information and documents, pictures</span>
Email attachments hope this helps
Answer:
From the given diagram, consider a MIN node whose children are terminal nodes, if MIN plays
suboptimal. MIN will never be lower than the utility obtained playing against an optimal MIN
MIN will always select a move having minimax utility greater than or equal to the move that is
predicted by the minimax that is the MIN-played optimal value.
Then the MIN node's value is increased to MAX. This is done by induction.
One can do better than the minimax strategy, if the suboptimal play is predicted by MIN.
If MIN always falls for certain for certain kind of trap and losses, then setting up a trap guarantees a win.
Explanation:
See attached picture also.