Analyze the running time of the following algorithms asymptotically.

(d) Algorithm WhileLoop2(n): X = 0; j=n; while (j >=1){ x= x + 1; j = 2j/3; } (e) Algorithm While Loop3(n): x = 0; j = 2; while (j 2){ x= x + 1; j = Vj; } (g) Algorithm While Loop4(n): x = 0 j=n while (j > 1) for i = j to n do x= x +1 j =j-1 return c