Prove that the cayley digraph given in does not have a

Question

Work as a group to discuss the problems and solutions. Your individual paper must contain the following critical elements:

A. Type of problem: Identify the type of problem. Does this problem involve computations, problem solving, proving, or a mix? Explain.

B. Solution to problem where relevant:

1. Correctly solvethe problem using a valid method of proof or verification using mathematical reasoning.

2. Write your solution using a logical sequence of steps. The proof or verification should include a comprehensive solution with a logical and sequential flow for the reader.

C. Description of method: In 1-2 paragraphs, describe the method you used. Explain why you chose that method.

D. Approach to problem: In 1-2 paragraphs, discuss the motivation behind your solution, including what research you conducted and how you approached the problem.

Show that the Cayley digraph given in Example 7 has a Hamiltonian path from e to a.

Q⁴ = (a,b|a⁴  = e, a² = b², b^-1ab = a³).

Prove that the Cayley digraph given in Example 6 does not have a Hamiltonian circuit. Does it have a Hamiltonian path?

A4 = [(12)(34),(123)]