What is the worst-case running time of the following algorithm? Express the worst-case running time using the big-O notation. algA1 (int n){ if (n == 1) { print (“It is done"); } else { algA1(n/2); }...

Please answer the question in the screenshot. The language used is Java.

Extracted text: What is the worst-case running time of the following algorithm? Express the worst-case running time using the big-O notation. algA1 (int n){ if (n == 1) { print (“It is done"); } else { algA1(n/2); } } Note: You can safely assume that n is a positive integer.