Exercise 10.2.4: Using the bijection rule to count ternary strings whose digits sum to a multiple of 3 About Let T 0, 1, 2). A string x E T is said to be balanced if the sum of the digits is an integer multiple of 3 Show a bijection between the set of strings in To that are balanced and TS. Explain why your function is a bijection. How many strings in To are balanced? Feedback? Exercise 10.2.4: Using the bijection rule to count ternary strings whose digits sum to a multiple of 3 About Let T 0, 1, 2). A string x E T is said to be balanced if the sum of the digits is an integer multiple of 3 Show a bijection between the set of strings in To that are balanced and TS. Explain why your function is a bijection. How many strings in To are balanced? Feedback