Write Java program implementing five different algorithms as given in the lecture slides for computing nth Fibonacci number. In a single diagram where x-axis represents n and y-axis represents running time, show the functions/curves/plots for all five algorithms with crystal-clear labelling. Analyse which of the five is the fastest algorithm in practice. (The table of running times for different Fibonacci algorithms and the single plot will go to the scanned PDF.