1. The problem statement, all variables and given/known data I don't really understand how/why every Boolean function of n variables may be implemented with a delay complexity of O(n). Could someone please try and explain? 2. Relevant equations 3. The attempt at a solution I was trying to show it using minterms (SOP). There is a maximum of 2^n minterms but how do I derive the delay? There is also a maximum of n-1 OR gates between these minterms.