6. Design an efficient divide and conquer algorithm that calculates the sum of the values stored in internal nodes of a binary tree. Show an expression for the number of additions and an expression for the number of comparisons. Justify your answers