The answers plz I need it rly fast

Can someone me with these two circle theorem questions asap?

Suppose you are choosing a 6-digit personal access code. this code is made up of 4 digits chosen from 1 to 9, followed by 2 letters chosen from a to z. any of these digits or letters can be repeated. find the total number of personal access codes that can be formed. 492,804 341,172 39,917,124 4,435,236

Acaterer knows he will need 60, 50, 80, 40 and 50 dinner napkins on five successive evenings. he can purchase new napkins initially at 25 cents each, after which he can have dirty napkins laundered by a fast one-day laundry service (i.e., dirty napkins given at the end of the day will be ready for use the following day) at 15 cents each, or by a slow two-day service at 8 cents each or both. the caterer wants to know how many napkins he should purchase initially and how many dirty napkins should be laundered by fast and slow service on each of the days in order to minimize his total costs. formulate the caterer’s problem as a linear program as follows (you must state any assumptions you make): a. define all variables clearly. how many are there? b. write out the constraints that must be satisfied, briefly explaining each. (do not simplify.) write out the objective function to be minimized. (do not simplify.)