If n = 32, how many bits would be required to represet the state st = ?

CONSTRUCTION 3.30 Let F be a pseudorandom function. Define a stream cipher (Init, Next) as follows, where Init accepts a 3n/4-bit initialization vector and Next outputs n bits in each call: - Init: on input s{0,1}n and IV{0,1}3n/4, output st = (s,IV,0). - Next: on input st =(s,IV,i), output y:=Fs(IVi) and updated state st =(s,IV,i+1)