Consider the SHA-3 option with a block size of 1024 bits and assume that each of the lanes in the first message block (P0) has at least one non-zero bit. To start, all of the lanes in the internal state matrix that correspond to the capacity portion of the initial state are all zeros. Show how long it will take before all of these lanes have at least one non-zero bit. Note: Ignore the permutation. That is, keep track of the original zero lanes even after they have changed position in the matrix.