Can use code to solve or by hand either one works. Thanks.

(a) 104 116 116 112 115 58 47 47 119 119 119 46 121 111 117 116 117 98 101 46 99 111 109 47 119 97 116 99 104 63 118 61 106 70 75 118 70 99 114 48 49 82 89

(b) One can convert a sequence s:=(s1,,s43)(Z/(256))43 (e.g., the one you found in Part (a)) into a number n(s){0,,256431} as follows: Let n(s):=s1+256s2++25642s43. So what would n(s) be if s is the sequence from Part (a)? (c) Converting numbers in {0,,256431} to sequences in (Z/(256))43 is easy via base256 expansions. In particular, given any n{0,,256431}, consider the sequence s(n):=(s1,,s43) defined via the following recurrence: s1:=(nmod256)s2:=(m1mod256)s43:=(m42mod256),m1:=n/256,m2:=m1/256,m43:=m42/256 (So the si are nothing more than the digits of the base-256 expansion of n.) Using this method, what message would you get if n were 15565728732977275987537732464288335871582590656780416209943917687896713120752382885278924529477398852712 and you decoded s(n) into a sequence of ASCII characters