Let s be a finite set of positive integers whose largest element is n. prove that there exists a graph g of order n +1 such that (1) deg u es for every 48 chapter 1. introduction to graphs vertex u of g and (2) for every de s, there exists a vertex v in g such that deg v= d.

the 3rd option is right

step-by-step explanation:

answer: 20

step-by-step explanation:

hello,

b) 62.47% of the students are between 14 and 18 years old.

step-by-step explanation:

mean = 15 and standard deviation = 2

student between 14 to 18

formula used z-score

for age 14 , z score

using z-table , p(z> -0.5)=0.3085

for age 18 , z score

using z-table , p(z< 1.5)=0.9332

p(-0.5< z< 1.5)=0.9332-0.3085 = 0.6247

thus, 62.47% of the students are between 14 and 18 years old.

click to let others know, how is it

0.0

0 votes

1

report

read more on -

step-by-step explanation:

b. would be the answer : )

step-by-step explanation:

step 1: add -16x to both sides.

16x−4y+−16x=64+−16x  

−4y=−16x+64

step 2: divide both sides by -4.

−4y /-4 = -16x + 64/-4

answer:   y=4x−16

hope i'm right