Let n and b be positive integers such that n >b>1. Consider the loops below. Com- pute the number of iterations each loop has to go through. How does it compare with log, n? Is it 2(log, n)? 0(log,n)? or O(log, n)? Loop1(n) while n>1 endwhile member that log n is just log2 n ath majors, consider yourselves warned! 1 Loop2(n) while n 100 endwhile loop3(n) while n