Q: Imagine a function named find_mod_2 to find modulo 2 for each integer between 0 and 10, inclusive. The result of your first function should be the sequence: 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0 Write a function named find_mod_x to find the modulo X for each integer between 0 and 10, inclusive. The return value should be a list. [1 point) U def find_mod_x(x) -> list: # YOUR CODE HERE raise Not ImplementedError()