Please write this program in python language. make sure it runs, and please post the screenshot of output. This is for a cryptography class

Program name: Fast-Exponential Implementation ( Just mentioning the name because I thought It might be easier for you).

So, As part of DH exchange-key, Alice and Bob need to do the fast exponential efficiently. Based on the algorithm in the picture, please implement it. You need to take(a,x,n) and output a^x (mod n). Please also output the table of squaring-multiplying as well.

Thank you in advance and i pomise to give you a thumbs up

Figure 79: Algorithm for fast exponentiation Squaring Multiplying 310 211 111 010 172 mod 21=16 162 mod 21 =4 52 mod 21 = 4 52 mod 21=4 17 16 174mod 21 = 5 174mod 21 5