$1)$ This question involves decoding using a brute force decryption mechanism.

Brute Force decryption: Brute force is a trial$-$and$-$error method used by application programs to decode encrypted data such as passwords.

Consider the following table:

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Using Brute Force, you need to keep shifting until a readable message is found.

Our problem

Consider the following secret message:

IBA THU PZ UVA THKL MVY KLMLHA H THU JHU IL KLZAYVFLK IBA UVA KLMLHALK

It has been encoded with a secret shift key that is not provided in this question.

a$)$ What is the total number of shifts in a Worst$-$Case Scenario.

b$)$ Decode the cipher message, writing it in lowercase letters.

c$)$ Encode the obtained text message using a left shift and the shift key value is found from GCD $(1701,3768).$

d$)$ Show all the details of your work.$($write a functional octave code regarding this question$)$