Please help with excerise 2.1:

does the following piece ( f G AccessUH-University of Content-20185P-15942- hw1.pdf Textbook COSC 3320, D file:///C:/Users jerom 02018/COSC%203320/Textbook/Te 3 320.2n0%20edition.pdf 0(V2logn), Hence FastIsPrime runs in 0(2(log n)/2) exponential time. 1.e., 1t also runs in 2.6 Exercises Exercise 2.1. Does the following piece of psuedocode terminate? Justify your answer The input to the pseudocode is a natural numbern. Algorithm foo(n) 2: while i