We saw in class that LZ77 compression requires storing of integers representing the match position and length. In this problem we consider binary prefix codes over the set of natural numbers N = {1, 2, 3, . . . }, where a codeword dj is associated with the natural number j. Notation: 0j denotes a sequence of j zeros.

it is a. 4.2 because 7.6-3.4 gets the remaining length of 4.2. i might be wrong but i am pretty sure this is the answer.

answer: x=3 and y=4

step-by-step explanation:

for this case we have by definition, if two lines are perpendicular, then the product of their slopes is -1.

then, given the following line:

so,

we are looking for m_ {2}:

then, the line is given by:

we find "b" replacing the given point:

finally, the equation is:

option c