Remarks: In all algorithm, always explain how and why they work. ALWAYS, analyze the complexity of your algorithms. Prove that it works. In all algorithms, always try to get the fastest possible. A correct algorithm with slow running time may not get full credit. In all data structures, try to minimize as much as possible the running time of any operation. . Question 5: Say that the input has three numbers a, b, c. And we have an algorithm that runs in time at most 2 log a+b'/3+ (logc)3. Does the algorithm run in polynomial time