The first problem you need to solve is the whether or not the quantity requested by the

user is a viable option when ordering chicken nuggets at McDonalds. Assume that you can

purchase chicken nuggets in quantities of $6,9,$ and $22.$ That means that there is no combination

of options that will allow you to purchase $23$ chicken nuggets. In terms of the Diophantine

equation, you can think of it as $6$a $+9$b $+22$c $=$ n$.$ To achieve this objective, there are four

specific requirements. Start by asking the user how many chicken nuggets they would like to

order. For each possible order quantity by box size identify which combinations equivalent to n

$($in other words, look for what values of a$,$ b$,$ and c in the Diophantine equation work$).$ If the

order is possible, print a statement to the console that states how many options are available and

what these options are $($a console output example is shown in Figure $2).$ If there are no

combinations that work $($such as an order of $23),$ let them know that they cannot order the

requested quantity.