How many digit operations are performed in total when increasing a ternary counter from 0 to n ? (A ternary counter uses digits 0,1,2.) Given an answer with a complete justification (a charging scheme or a potential argument). 4. Consider a hash table of size m=2b and a hash function h(k)=k(modm). (This is the division has function.) Is this a good hash function? Justify your answer. 5. Consider a hash table of size m=2b and a hash function h(k)=(kk)m, where =0.25. Is this a good hash function? Justify your