In the Following Code That Uses Recursion to Find the Greatest

question 5

Multiple Choice

In the following code that uses recursion to find the greatest common divisor of a number, what is the base case? public static int gcd(int x, int y)
{
If (x % y == 0)
Return y;
Else
Return gcd(y, x % y) ;
}

• A) gcd(int x, int y)
• B) if (x % y == 0)
• Return y;
• C) else
• Return gcd(y, x % y);
• D) Cannot tell from this code

---

Definitions:

Duty Of Care

The legal obligation to avoid acts or omissions that could foreseeably cause harm to others.

Regulation

Rules or directives made and maintained by an authority to control or govern behavior within a system.

Malicious Prosecution

A tort action based on criminal or quasi-criminal prosecution motivated by ill will toward the accused and lacking reasonable evidential grounds for proceeding.

Qualified Privilege

Exemption from liability for defamatory statements made pursuant to a duty or special interest, so long as the statement was made honestly and without malice and was circulated only to those having a right to know.