Python sagemath programming

Problem 6: Graphs and number theory Grading criteria: correctness of code 6a. Read the definition of a Paley graph, then write a function that, given a prime p congruent to 1 modulo 4, constructs the Paley graph associated to that prime. (There also exist Paley graphs associated to prime powers, but your function need not construct those.) In t 1 6b. Using your answer to 6a for p-13 and the Paley construction, construct (but do not print) a 28 28 which achieves the Hadamard determinant bound. In t 1 6c. Check that your answer to 6b actually does achieve the Hadamard bound. In t : Problem 6: Graphs and number theory Grading criteria: correctness of code 6a. Read the definition of a Paley graph, then write a function that, given a prime p congruent to 1 modulo 4, constructs the Paley graph associated to that prime. (There also exist Paley graphs associated to prime powers, but your function need not construct those.) In t 1 6b. Using your answer to 6a for p-13 and the Paley construction, construct (but do not print) a 28 28 which achieves the Hadamard determinant bound. In t 1 6c. Check that your answer to 6b actually does achieve the Hadamard bound. In t