1. From Andy's house to Billy's hometown you can travel by 3 roads. And to get from Billy's hometown to Willie's house you can travel by 5 roads. How many possible ways are there to travel from Andy's house to Willie's house? 2. From Dan's ranch, one road is built to get to Andy's house and two roads are built to get to Willie's house (see previous problem). How many ways are there now to get from Andy's house to Willie's house?

Step-by-step explanation:

Hello,

1. From Andy's house to Billy's hometown I can choose among 3 roads

and for each of them I can choose among 5 roads to go to Willie's house

so it means that I have 3x5= 15 ways to travel from Andy's house to Willie's house

2. From Andy's house we can still pass by Billy's house so we still have the 15 ways but now we can go from Andy's to Dan's ranch and then to Willie's house. it means we have additional 1*2 = 2 ways.

in total it gives 17 ways

1,918

step-by-step explanation:

answer: evaluate the objective function at each vertex to determine which - and -values, if any, maximize or minimize the function. example: find the minimum value and maximum value of the objective function f ( x , y ) = 4 x + 5 y , subject to the following constraints