Consider the problem of summing n numbers by adding together various pairs of numbers and/or partial sums, for example, {[(3+1)+(2+5)]+9}.
(a) Represent this addition process with a tree. What will internal vertices represent?
(b) What is the smallest possible height of an "addition tree" for summing 100 numbers?