Assume you are using the Dictionary-as-asString approsch to compress the index. The B-Troe for all terms ia shown in Figure (i) below. The links betieen the b-tree nodes are shown in darker arrows. Tha amount of space occupied by a term pointer is 3 bytos. Now, you want to compeoss the index further by using blocking. You use 1 extra byte per term to store its length, figure (ip) shows the new b-tree ieing blocking. The darker. arrows indicate the links of the b-tree and the lighter arrows indicate the links for blocking. How much space weil you end up saving with biocking. for block sies of =5 ? (i) (ii) Select one: None of the options 10 bytes 7 bytes 15 bytes