You have access to any number of toy molds of the number 8. The pieces can be stacked contiguously in sets of one or more, to form an all-8 algebraic number. For example, a 3-peice set reads as 888. The puzzle seeks the smallest number of pieces arranged in sets of 8s (where a same set may repeat more than once, if necessary), such that the resulting algebraic sum add up to numeric value, N. Formulate the puzzle as ILP, then solve for

(a) N = 1000.

(b) N = 2500.