Suppose we encode text by converting the underlying sequence of characters via ASCII to a sequence of numbers in {0,..., 255}. What sequence of numbers would you get from the string https://www.youtube.com/watch?v=jFKvFcr01RY ? 43 (b) One can convert a sequence s:= ($,..., S43) (Z/(256)) 4 (e.g., the one you found in Part (a)) into a number n(s) = {0,..., 2564 - 1} as follows: Let n(s): s + 256s2 + +25642 S43. So what would n(s) be if s is the sequence from Part (a)? (c) Converting numbers in {0,..., 25643 - 1} to sequences in (Z/(256)) 43 is easy via base- 256 expansions. In particular, given any n {0,..., 2564 - 1}, consider the sequence s(n):= ($,..., S43) defined via the following recurrence: S := (n mod 256) m := [n/256] S2 = (m mod 256) m = [m/256] := : 9 9 S43 := = (m42 mod 256) m43 = [M42/256] := 9 (So the s are nothing more than the digits of the base-256 expansion of n.) Using this method, hat message would you get if n were 15565728732977275987537732464288335871582590656780416209943917687896713120752382885278924529477398852712 and you decoded s(n) into a sequence of ASCII characters?