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;}