$4)$ Affine Cipher is an example of a Monoalphabetic substitution cipher. The encryption process is substantially mathematical done by using the following formula:

C $=($P $1+2)$ mod $26.$

Where k$1,$ k$2$ are two integers representing the key $($selected randomly$),$ C is the ciphertext value, and P is the plaintext value. Where C and P integers with values between $0$ and $25.$ Write an Octave programme to implement this system, run your programme using Plaintext: $$the quick brown fox jumped over the lazy dog$.$ Show the obtained ciphertext with the selected values of the keys k$1$ & k$.$