Write a RandomCipher function that builds a dictionary where each of the 26 letters of the alphabet is randomly matched to another (all lowercase). Each of the matching letters should be unique (in other words, your function creates a bijective mapping). Example:

{ 'a':'g', 'b':'i', 'c':'b', 'd':'d', 'e':'y', 'f':'q', 'g':'a', 'h':'p', 'i':'i', 'j':'c', 'k':'y', 'l':'z', 'm':'w',

'n':'c', 'o':'v', 'p':'z', 'q':'s', 'r':'h', 's':'x', 't':'e', 'u':'v', 'v':'p', 'w':'s', 'x':'j', 'y':'f', 'z':'w' }

Write an Encode function that takes a plain text string as input and returns a new string encrypted using your cypher in part (a). Make sure to replace all letters once only; leave punctuation and other non-alphabetical characters as is. Example: if using the above mapping, the text "hello, world!" would be encoded as "pyzzv, svazd!"

Write a Decode function that takes an encrypted text string as input and returns a new string decrypted using your cypher in part (a). Create any intermediate data structure as required to make your code efficient. Example: "pyzzv, svazd!" should be decoded as "hello, world!" (Encoding followed by decoding should always produce the same string.)