Answer:
462 paths from A to B
Step-by-step explanation:
The question is incomplete. However, a possible question is to determine the number of possible paths on the grid map.
The first step is to represent the grid map itself. (See attachment 1)
From the question, we understand that:
- Only right movement is allowed in the horizontal direction
- Only up movement is allowed in the vertical direction
There are a several number of ways to navigate through. However, one possible way is in attachment 2
In attachment 2,
- R represents the right movement
- U represents the up movement
And we have:
and 
The number of possible paths (N) is then calculated as:

Substitute values for N and U





<em>Hence, there are 462 possible paths from A to B</em>
A = l*w
A = 4*12 = 48cm^2
The area of the rectangle is 48cm^2 (cm squared)
I think it’s 196? base 1 +base 2=28 radius is 7 but we need the whole thing so 7x2=14.
then multiply and then divide by 2 28X14= 392 divided by 2 = 196
Answer:
D(4,-3)
Step-by-step explanation:
Given three of the vertices of the square: A(4, -7), B(8, -7),C(8, -3)
Let the coordinate of the fourth vertex be D(x,y).
We know that diagonals of a square are perpendicular bisector. So, the midpoint of both diagonals is the same.
The diagonals are BD and AC
Midpoint of BD = Midpoint of AC

The coordinates of the fourth vertex is D(4,-3)