please show steps to make it easy to understand, i give thumb up directly

(1 point) Consider a simplified version of the RC4 stream cipher where at the end of each iteration the generated keystream is only 3 bits long. Assume that the lookup table S has gone through the initialization step resulting in S=[7,4, 0, 1, 2, 5, 3, 6]. Given the keystream generation code below, the first generated 3-bit keystream will be /* Keystream Generation */ i, j = 0 while TRUE i = (i + 1) mod 8 j = (j + S[i]) mod 8 swap (S[i], [j]) t = (S[i] + S[j]) mod 8 keystream S[t] =