Find the running time function and use the Big-O notation to classify the algorithms below

Find the running time function and use the Big-O notation to classify the algorithms below //-Algorithm 1 int i = n: while(i > 0) { i/= 10: } //-Algorithm 2 int i = n: int s = 0: while(i > 0) { for (j = 1: j 0) { for (j = 1: j 0) i/= 2: //-Algorithm 5 for (j = 1: j 0) i/= 2: }