some java questions recursion and order of an equation

i just have a question which was in one of my exams
I am looking for answers please help Thanks !

Given the following algorithm in pseudo code, and the knowledge that for problem size 100 the "while loop" executes 100 times and the "for loop" 2 x 106 times.

1)
2) while (condition)
2.1)
2.2)
3) for (condition)
      3.1)
      3.2)
      3.3)
      3.4)
4)
5)

a)  What is the runtime equation of this algorithm?

b)  What is the order of this algorithm?


QUES 2 -----------------------------------

Part- a ) Given the following code, convert this into a non-recursive method.

private void Insert_End (node ptr, Data data){
    if (ptr.next != null) {
        Insert_End(ptr.next, data);
      else
        ptr.next = Create_Node(ptr.data);
    }
}

Part-b ) - What is the runtime equation of the recursive and non-recursive code?