we have

using a graph tool
see the attached figure
For t=0 d=4 -------> the y-intercept
that means that at the time t=0 the house was four units away.
For t=60 min d=0 -------> x-intercept
that means he was already at home at the time t=60 minutes.
therefore
the graph of this equation represents the walk towards the house
Answer:
see attached
Step-by-step explanation:
Rotation 270° counterclockwise is equivalent to rotation 90° clockwise. The transformation of coordinates is ...
(x, y) ⇒ (y, -x) . . . . . . . rotation 270° CCW
This means the points are moved to ...
A(-2, 1) ⇒ A'(1, 2)
B( 1, 2) ⇒ B'(2, -1)
C(-2, 4) ⇒ C'(4, 2)
The rotated triangle is shown in the attachment. You may notice that A' and B are the same point.
Answer:
I. m = 2401
II. ((n+1) ∆ y)/n = 1/n[(n – y + 2)(n – y) + 1]
Step-by-step explanation:
I. Determination of m
x ∆ y = x² − 2xy + y²
2 ∆ − 5 = √m
2² − 2(2 × –5) + (–5)² = √m
4 – 2(–10) + 25 = √m
4 + 20 + 25 = √m
49 = √m
Take the square of both side
49² = m
2401 = m
m = 2401
II. Simplify ((n+1) ∆ y)/n
We'll begin by obtaining (n+1) ∆ y. This can be obtained as follow:
x ∆ y = x² − 2xy + y²
(n+1) ∆ y = (n+1)² – 2(n+1)y + y²
(n+1) ∆ y = n² + 2n + 1 – 2ny – 2y + y²
(n+1) ∆ y = n² + 2n – 2ny – 2y + y² + 1
(n+1) ∆ y = n² – 2ny + y² + 2n – 2y + 1
(n+1) ∆ y = n² – ny – ny + y² + 2n – 2y + 1
(n+1) ∆ y = n(n – y) – y(n – y) + 2(n – y) + 1
(n+1) ∆ y = (n – y + 2)(n – y) + 1
((n+1) ∆ y)/n = [(n – y + 2)(n – y) + 1] / n
((n+1) ∆ y)/n = 1/n[(n – y + 2)(n – y) + 1]
The answer would be 105.41
Explantaion: 122 • 0.2=24.4
122-24.4=97.6
97.6•0.08=7.808 which rounded to the nearest hundredths would be 7.81 then 97.6+7.81=105.41
The image is decomposed as follows: H1 and H2. Where original graph is Hx.
<h3>Are the images (attached) valid decompositions of the original graph?</h3>
- Yes, they are because, H1 and H1 are both sub-graphs of Hx; also
- H1 ∪ H2 = Hx
- They have no edges in common.
Hence, {H1 , H2} are valid decomposition of G.
<h3>What is a Graph Decomposition?</h3>
A decomposition of a graph Hx is a set of edge-disjoints sub graphs of H, H1, H2, ......Hn, such that UHi = Hx
See the attached for the Image Hx - Pre decomposed and the image after the graph decomposition.
Learn more about decomposition:
brainly.com/question/27883280
#SPJ1