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.

Sample response: if the graph passes the horizontaline test, then the function is one to one. functions that are one to one have inverses that a therefore, the inverse is a hinction compare your response to the sample response above. what did you include in your explanation? a reference to the horizontal-line test d a statement that the function is one-to-one the conclusion that the inverse is a function done

Give the functions f(x) = |x + 2| - 3, what is the domain? a, b,c, or d all real numbers x > 2 x < -2 all real numbers and x cannot equal to 2

Use the following random list of 100 numbers and the same assignations as in the example (0-4 represent girls and 5-9 represent boys) to answer the questions below. 3199 9288 1023 1130 0809 1770 6231 7538 8927 4761 7258 7111 0209 0916 1450 9848 4654 7579 6150 3093 9608 0061 4014 9501 0382 3052 2385 9074 1664 6551 6577 1811 3454 5870 1277 5056 1063 5697 9141 4120 9181 1343 0168 3693 0463 4842 1704 3774 4908 4161 6404 9675 2518 3988 4268 6083 0636 9634 5295 5656 1918 3133 6831 8393 6363 2452 1531 1638 1317 2279 9395 0702 2091 5269 0422 0275 3373 1424 1958 0356 5163 0743 6658 6257 2772 0570 4522 2665 0890 3560 5549 2238 2172 9715 9741 4975 6617 9034 4441 8220 based on the results of the second simulation, what is the experimental probability that a group will include only boys? based on the results of the second simulation, what is the experimental probability that a group will not contain four boys?