In python please Vigen`ere Cipher Here we are going to write a simple tool to decrypt the ciphertext created by a Vigen`ere cipher. Your goal in here is to write a program that can help decrypt The following message encrypted by the Vigen`ere cipher.

nenusyegjlegnpwzealpffgzcohojvvsjkwoddirsaoomyaoevzwvoztwjvwfsxldyuselxmngoksvzfyifwcaxouevcnxgqpvrwjtbumuofvdcllusmhzpletrusepwejrtgkshafpovafwmaqocojhbxzpccjhvizlhmpwfqxazhcdnsrgkhrfvmlhvuzngksokrvefoxdgkkinhclxqcietprlaehfqwrzqxtulgfdwjzrsrqqdudkhuuflbspvvyzgrqsdaqzsyeelvalsprlwrusmxzvwfuglzuvsdxkunowzzsorwcblboervqtebuamupvbfusrizzoihgenwspscigkhnwweebjbecjlht pvvnvyjrfphsejkhrlhtafndphbsskkixhktbusmzhyhdefvosapvifrrwvqdcdhnoenweziv

Implement the function that finds the factors of observed distances.

For efficiency, we only consider factors smaller than 16.

Ignore the trivial factor 1 (it is the factor of all integers).

def kasiski_test(ciphertext): "" A driver program "" repeated_distances = get_distances_between_trigrams(ciphertext) key_len_to_try = get_all_factors(repeated_distances, max_key_len=20) for i, candidate in enumerate(key_len_to_try): print(f"Candidate [{i}]:{ candidate [0]} ") def get_all_factors(repeated_distances, max_key_len=20): "" Returns all the factors of observed distances. For each distance value in repeated_distances', find its factors and then compute their frequencies. Parameters: ---------------- repeated_distance: a dictionary containing repeated trigrams and the