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.
The answer would be p + s = q + s ...so it would be B.
You would do an arithmetic sequence
use A1 +(n-1)d to calculate number of seats in the last row
An = 4+(24-1)5
An = 4 + (23)(5)
An = 4 + 115
An = 119 seats in the last row
now use a sum sequence to find total number of seats
Sn = n(a1 + an)/2
Sn = 24(4+119)/2
Sn = 24(123) /2
Sn = 1476 total seats
Answer:
3460
Step-by-step explanation: