Task: 1. (3 marks) Let : , and let and be subsets of . Show that 1( ) = 1() 1(). Hint: revisit the sets section 2. (4 marks) Determine whether is injective if both and are injective. 3. (3 marks) Determine whether is a function from the set of all bit strings to the set of integers, where () is the position of a 0 bit in . Note: to get full grade, write and explain your answers in details. Submitted materials: - Each group has to submit a handwritten answers showing the output of each step in details. - Grading policy: Materials must be submitted no