Consider the postings list h4, 10, 11, 12, 15, 62, 63, 265, 268, 270, 400 with a corresponding list of gaps h4, 6, 1, 1, 3, 47, 1, 202, 3, 2, 130. assume that the length of the postings list is stored separately, so the system knows when a postings list is complete. using variable byte encoding: (i) what is the largest gap you can encode in 1 byte? (ii) what is the largest gap you can encode in 2 bytes? (iii) how many bytes will the above postings list require under this encoding?