Let \(A\) be the adjacency matrix of the given graph with vertices \(\{1,2,3,4,5\}\). Let \(\lambda_1, \lambda_2, \lambda_3, \lambda_4, \lambda_5\) be the eigenvalues of \(A\) (not necessarily distinct). Find: \[ \lambda_1 + \lambda_2 + \lambda_3 + \lambda_4 + \lambda_5 \;=\; \_\_\_\_\_\_ . \]
Consider the Deterministic Finite-state Automaton (DFA) A shown below. The DFA runs on the alphabet \(\{0, 1\}\), and has the set of states \(\{s, p, q, r\}\), with \(s\) being the start state and \(p\) being the only final state.Which one of the following regular expressions correctly describes the language accepted by A?