Let n denote the size of an input in bits and N denote the size in a number of items. Define an algorithm to be c-incremental if any primitive operation involving one or two objects represented with b bits results in an object represented with at most b + c bits, for c ≥ 0. Show that an algorithm using multiplication as a primitive operation may not be c-incremental for any constant c.