Given n agents, prove that the dynamic programming algorithm (DP)
for coalition structure generation runs in O(3^n).
Tip: compute the number of required operations, and show that this number, as we increase n, grows in a similar way to the growth of 3^n.