1. We saw in the lecture that every symbol of an alphabet of size k >1 can be encoded using at most [log k] many bits by assigning to every alphabet symbol an index i and then encoding
i in binary. Recall that in computer science logarithms are usually to base two.
(a) Develop an algorithm that given a natural number i computes the binary representation
of .
(b) Inspecting your algorithm, can you argue that the binary encoding of any i > 0 has
1 + Llog | many bits?

Answer: this depends on the amount required to pay off the individual's card as well as how large the minimum payments are.if the amount is significantly large and the minimum payments are significantly small, then it will take a longer time to pay off the credit card.if the amount is significantly small and the minimum payments are significantly large, then it will take less time to pay off the credit card.hence, it would be difficult to answer true or false to this statment.however, for the purpose of this statement, it is most likely assumed that regardless of the amount to pay off the credit card the minimum payments would be quite large.therefore, the better option would be to pick 'true' as your answer.hope this ! : )have a lovely day! < 3

Ithink you go to your settings

The answer would be d (tables)