For the following algorithms, in terms of its input, how many steps does it take? 1. ,---- | public int fun(int n){ | int m = 10; | int i=0; | while(i < n){ | m*=m; | i++; | } | return m; | } `---- 2. ,---- | public int fun(int n, int m){ | int r; | for(int i=0;i