just ii

Problem 2.26. Assuming that takes four times as long as the + operation does, and using four processors, construct a binary tree for each expression below with each of the following objectives in mind one at a time: (a) minimize execution time, (b) maximize efficiency, (c) maximize utilization. (Note: Expressions may be expanded without adding or removing any terms.) (i) a+b+c+d+e+f+g+h, (ii) a(b+c(d+e+f+g))