= Consider the summation o 2-1 i using the following binary fan-in tree algorithm described below for n = 8 but which clearly generalizes easily to n = 2k: 0= {[(80 + $i) + (E2 + 3)] + [($4 + $5) + (6 + $7)}} or equivalently 0 = &j, 05;