Refer to the Iterative algorithms presented in $($Maximum Element, Element uniqueness problem, matrix multiplication, Gaussian elimination, and counting binary digits$).$ Also, refer to the Recursive algorithms $($Factorial$,$ Tower of Hanoi, and Fibonacci numbers$)$ presented

Provide the following: algorithm, flowchart, pseudocode, and code implementation of all the iterative and recursive algorithms. In your code implementation, ensure that the user selects any of these algorithms, provides the necessary input $($s$)$ and provides the desired output to the user. Make your application interactive and user$-$friendly by providing clear steps and interfaces for ease of use. Provide comments and explanations of variables and data types used. Use theoretical $($O$,$ Omega, or theta notations$)$ or empirical analysis to determine the algorithm's complexity.