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.

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

Decode the cipher message, writing it in lowercase letters.