Recall that a value a has an inverse mod n iff a is relatively prime to n. For each of the values 1 to 34, compute and print or write each value that is relatively prime to 35 and its multiplicative inverse. I suggest writing a small program to do this. We have not discussed the extended Euclidean algorithm, which is the usual way of finding an inverse, so a brute force algorithm that tries all possible values to find an inverse is acceptable.