Achinese restaurant offers 10 different lunch specials. each weekday for one week, fiona goes to the restaurant and selects a lunch special. how many different ways are there for her to select her lunches for the week? note that which lunch she orders on which day matters, so the following two selections are considered different. one possible selection1.mon: kung pao chicken .2.tues: beef with broccoli3.wed: kung pao chicken4.thurs: moo shu pork5.fri: beef with broccolia different selection: a. mon: beef with broccolib. tues: kung pao chickenc. wed: kung pao chickend. thurs: moo shu porke. fri: beef with broccolinow suppose that in addition to selecting her main course, she also selects between water or tea for her drink. how many ways are there for her to select her lunches?

1) 30240 possible ways to select lunches without considering drinks

2) 967680 possible ways to select lunches without considering drinks

Step-by-step explanation:

Note: we assume that she does not take lunches for the weekend

if she has 10 possible lunches then

- the fist day she can find any of the 10

- the second day she can find 9 different lunches (since one appeared the day before)

- the 3rd she can find 8, the 4th 7 and the 5th 6

this can be summarised as

number of possible arrangements = 10*9*8*7*6 = 10! /( 10-5)! = 30240 possible ways

if she can add tea or water , independently of the food and knowing that she can repeat tea or water for lunch in the week then:

arrangements= food arrangements * drink arrangements = ( n!/(n-d)! )* ( 2^d )

= 10!/(10-5)! * 2^5 = 30240 * 32 = 967680 possible ways to select her lunches

mark branliest

step-by-step explanation:

.6 is 1/2 of 12

the answer is actually d. i just took the test

answer: -2+√x,-2-√x

i hope this , i don't know if you're looking for a pair or not.