What would be the pseudo code for this function:

Public static String reverseString(String text){

return new StringBuilder(text).reverse().toString();

}

Attached is a pseudo code example as a go by

Pseude code for primenumbers(int n) Step 1: Create a list of integers and label as primenumbers. Step 2: Check whether the Input Number n is less than Step3: If the above condition is true then print "Invalid Input" and exit the program. Step 4:Loop through starting from 2 to the given number n Step 5: Inside this loop call the function isPrime(n,2) which returns true if the number n is prime. Step 6:If the above condition is true then add the newly idetified prime number to the list. Step 7:Return the primeNumber list. Pseudocode for the function isPrime(int n.int i) Step I:Check whether the passed number n is equal to 2.If that is equal to 2 then the function returns true. Step 2:Check whether the Passed number n is divisible by i which is 2 initially. Step 3: If the above condition holds true then the function returns false. Step 4:Check whether the square of i is greater than the number n if that is true then the function returns true. Step 5:Function isPrime is recursively called if the above said conditions becomes false. Each time the function is called with updated value of i. For Example Initially value of i was 2 then it gets updated to i+1 that is3. The function will be called recursively until any of the above if condition becomes true