can you solved it using c++ please

LCM (1 point) This question concerns block cipher modes. We will use a simple affine cipher, which can be expressed in C as follows. char cipher(unsigned char block, char key) i return (key+11'block)%256. 3 Note that the block size is 8 bits, which is one byte (and one ASCII character). We will work with the fixed key Ox08. We now encrypt various plaintexts using modes for this cipher. In every case in which the mode requires an IV, the I will be OxAA In the case of CTR mode, we use a (nonce || counter) arrangement in which the nonce is the left 5 bits of OxAA and the counter is a 3 bit counter that begins at 0. In all of the problems given below, one character is one block. Each character of the plaintext should be regarded as its corresponding ASCII code. a) Encrypt the plaintext "brownish" using CTR mode. Please enter your answer in hex. (Please do not enter an Ox, as this has been done.) b) Encrypt the plaintext "bangs" using ECB mode. Please enter your answer in hex Ox c) Encrypt the plaintext "dangling" using CF B mode. Please enter your answer in hex d) Encrypt the plaintext "long" using CBC mode, Please enter your answer in hex o) Encrypt the plaintext "lowering" using OFB mode. Please enter your answer in hex Ox