Answer:
The probability that he teleports at least once a day = 
Step-by-step explanation:
Given -
Evan lives in Stormwind City and works as an engineer in the city of ironforge in the morning he has three Transportation options teleport ride a dragon or walk to work and in the evening he has the same three choices for his trip home.
Total no of outcomes = 3
P( He not choose teleport in the morning ) = 
P( He not choose teleport in the evening ) = 
P ( he choose teleports at least once a day ) = 1 - P ( he not choose teleports in a day )
= 1 - P( He not choose teleport in the morning )
P( He not choose teleport in the evening )
= 
= 
The preimage was shifted to the image by a translation 2 units right and 2 units up, so the answer is 
Answer:
(see image)
bottom right image
Explanation:
First try the origin (0,0) to rule out two of the graphs.
3y ≥ x - 9 3(0) ≥ (0) - 9
3 ≥ - 9
yes 3x + y > - 3 3(0) + (0) > - 3
3 > - 3
yes so the origin should be in the shaded area of the graph, which rules out the top right and bottom left graphs.
Now try a coordinate that is in the shaded area of one of the remaining graphs, but not in the other one. If it works, the graph is the one that has that point in the shaded region, and vice versa.
Try point (4, 2)
3y ≥ x - 9
3(2) ≥ (4) - 9
6 ≥ - 5
yes3x + y > - 3
3(4) + (2) > - 3
12 + 2 > - 3
14 > - 3
yesSo the graph is the bottom right one since (4, 2) is included in that shaded region.
Step-by-step explanation:
In words it is: The product of -11 and k is 22.
The solution is: -11 = +11
22+11 = 33
33 = k