Recall that a trail is a walk that does not contain a repeated edge, a closed trail is a trail whose initial and terminal vertices are the same, a non-trivial walk contains at least one edge, and a cycle is a closed trail where the only repeated vertex is the terminal vertex repeating the initial vertex. prove that every non-trivial closed trail contains a cycle.

10 will be the number of adult tickets and 11 will be the number of children tickets. i hope i could ! good luck : )

Period is the time it takes for one “cycle” to complete. in the parent sine function, period is 2*pi since sin(0) = 0, sin(pi/2) = 1, sin(pi) = 0, sin(3pi/2) = -1, and sin(2pi) = 0. at that point, the sequence repeats itself. i’m not sure if your graph is similar to the sine function since you didn’t provide a picture, but you can find the period by looking at a graph.