Give a state digram of DFA recognizing the following language. L={w belongs to alphabet star, w begins with 0 or ends with 0 but not both}. The alphabet is ={0,1,2}

(0,-3) see attached graph

step-by-step explanation:

a. to solve the system, graph the two equations.

x = y+3 becomes y=x-3 has m=1/1 and b=-3. start at (0,-3) on the y-axis and plot a point. then move up 1 unit and 1 unit to the right. plot a point and connect.

y=-4x+3 has m =-4/1 and b=-3. start at (0,-3) on the y-axis and plot a point. then move down four units and to the right 1 unit. plot a point and connect.

the solution is the point (x,y) where the two lines intersect. by the graph below it is (0,-3).

b. to solve by substitution, substitute y = -4x-3 into x= y+3

x= (-4x-3) +3

x=-4x

5x=0

x=0

now substitute x = 0 back in to find y.

y= -4(0)-3

y=0-3

y=-3

solution is (0,-3)

c. use elimination by adding the equations together.

x-y=3

4x+y=-3

5x=0

x=0

then substitute into one equation to find y.

y=-4(0)-3

y=-3

30 feet

step-by-step explanation:

that would be 2 1/2 * 12

= 24 + 6

= 30 feet   (answer)

( - 4 , -7 )

all the lines must parallel  

step-by-step explanation:

coordinates of c = ( - 1 , 2 )

3 units left = ( -4 , 2 )

9 units down = ( - 4 , 11 )

idk what the heck he answer is, i’m just putting this here so i finish my account