Please do part d.

Below is figures (2.3.2) & (2.3.3)

10. Each of the following functions has the form f() (ar b) mod n. Assume that each function has type Nn -N., so that we can think of f as a cipher for an alphabet represented by the numbers 0, 1,.. n 1. Use (2.3.2) to determine whether each function is a bijection, and, if so, construct its inverse. Then use (2.3.3) to determine whether the function has fixed points (i.e., letters that don't change), and, if so, find them. a, f(x) 2x mod 6. b, f(x) 2x mod 5. c, f(x) 5x mod 6. d. /(x) = (3x + 2) mod 6. e f(x) = (2x + 3) mod 7. f. f(x) = (5x + 3) mod 12. g, f(x) = (25a + 7) mod 16. h, f(z) = (4x + 5) mod 15