How do you analyze running time? What are the steps/rules? As an example, how could I solve the running time for the power algorithm?

Int power(int x, unsigned Int y) return 1; return power(x,y 2) * power(x, y / 2); return x * power(x, y/ 2) * power(x, y 2); else if (y % 2 0) else