Figure shows a mod-K counter, Here K is equal to

The K-map for a Boolean function is shown in figure. The number of essential prime implicants for this function is

An equivalent 2’s complement representation of the 2’s complement number 1101 is

Two 2' s complement numbers having sign bits x and y added and the sign bit of the result is z. Then, the occurrence of overflow is indicated by the Boolean function.