Answer:
It isn't possible.
Step-by-step explanation:
Let G be a graph with n vertices. There are n possible degrees: 0,1,...,n-1.
Observe that a graph can not contain a vertice with degree n-1 and a vertice with degree 0 because if one of the vertices has degree n-1 means that this vertice is adjacent to all others vertices, then the other vertices has at least degree 1.
Then there are n vertices and n-1 possible degrees. By the pigeon principle there are two vertices that have the same degree.
P-paratheses (do any math that has parentheses around the numbers) y=(2x5)+25
E-exponents (do the exponents next) y=(2x5)+5^2
M-multiplying. (Basically everything is self explanatory from here to then cuz im lazy to list examples)
Just basically if you don't use PEMDAS, you'll get the wrong answer
Sorry it took so long, here is your answer:
the answer is b Im pretty sure
