This assignment involves two related games. In each game the two players alternately name dates. The winner is the player who names 31st December and the starting date is 1st January.

Each of the two games use a different rule for the dates the player is allowed to name.

For each game. 1. Devise a winning strategy, stating which player should win. State also if it depends on whether the year is a leap year or not. 2. Write a pseudocode algorithm for optimum play.
The games are. a. (Easy) A player can name the 1st of the next month or increase the day of the month by an arbitrary amount. (For example, the first player begins by naming 1st February or any date in January other than the 1st). b. (Harder) A player can name the first of the next month or the next day of the current month. (For example, the first player begins by naming 1st February or 2nd January).

a

step-by-step explanation:

jjddbdhid r

well we know there are 4 clubs in 52 cards so it’s replaced so it should be 3/51

step-by-step explanation:

step-by-step explanation:

given expression is .

now we need to simplify the given expression .

we know that square root is equivalent to the power 1/2. so that means we can take half of the exponents to get the square root of given expression.

expanding that will give a very very large number so let's keep answer in exponent form.

the equation of the parallel line would be y = 2x + 9

step-by-step explanation:

to start we need to find the slope of the original line. we can do that by looking at the coefficient of x, which is 2

since the slope of the original line is 2 and parallel lines have the same slope, we know the new line will also have 2 slope. now we can use that along with the point given in point-slope form to get the find equation.

y - y1 = m(x - x1)

y - 5 = 2(x + 2)

y - 5 = 2x + 4

y = 2x + 9