Copyright © University of Cambridge. All rights reserved.
'Counting Binary Ops' printed from https://nrich.maths.org/
You can do this by drawing trees for each case. Don't change the
order in the list of terms. You can only combine adjacent terms and
only two at a time.