Consider the following definitions for sets of characters: Digits {0,1,2,3, 4, 5, 6, 7, 8, 9} = Letters {a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z} = Special characters = {*, &, $, #} Compute the number of passwords that satisfy the given constraints. Express your answer in powers of 40, do not evaluate to a single numeric value. a Strings of length 6. Characters can be special characters, digits, or letters. b Strings of length 7, 8, or 9. Characters can be special characters, digits, or letters. c Strings of length 7, 8, or 9. Characters can be special characters, digits, or letters. The first character cannot be a letter.

C programming language question

نقطة واحدة Let A = {a; b; c; d} and R= {(a; a); (b; c); (c; b); (d; d)} then R is Transitive Equivalent not transitive

Sum of two squares def sum_of_two_squares(n): Some positive integers can be expressed as a sum of two squares of some positive integers greater than zero. For example, 74 = 49 + 25 = 72 + 52. This function should find and return a tuple of two positive integers whose squares together add up to n, or return None if the parameter n cannot be broken into a sum of two squares. To facilitate the automated testing, the returned tuple must present the larger of its two numbers first. Furthermore, if some integer can be broken down to a sum of squares in several ways, return the breakdown that maximizes the larger number. For example, the number 85 allows two such representations 72 + 62 and 92 + 22 , of which this function must return (9, 2). The technique of two approaching indices that start from the beginning and end of a sequence, respectively, and approach each other until they meet somewhere, used in the function two_summers in one of our class examples, is directly applicable to this…