Answer Happy

Please provide a clear explanation of how the problem is solved
with as much detail as possible. Any possible directions/solutions
have used Java.
Question 1 (18 points): Consider the following code snippet and determine the upper bound of time complexity of this code: Void test(int n){ if(n>1){ print (“Hello”); test(n/2) } }