Please, answer all question A,B,C,D,E,F,G: MAny thanks.

Given the Binary Tree below: B2 40 43 60 94 18 63 Answer the following questions (1 point each): What is the depth of node holding key value 18? b. Determine the height of the tree. c. How many internal nodes are there in this tree? How many external nodes are there in this tree? e. List the "order of visit'' resulting from a Pre-order Traversal method starting from the Root node