Consider a ternary counter variation of the binary counter, which represents numbers with bits 0,1 and 2. Recall that while using the aggregate method for amortizing the cost of a binary counter increment, we were required to calculate the total cost of n increment operations using a geometric series. Repeat this process for the ternary counter. What is the amortized cost of a single increment on the ternary counter?