Iterative algorithms are algorithms that iterate until some predefined number is reached. For example, if we define the number of iterations as $100,$ this means that the algorithm will iterate or repeat starting from k $=1,23,100$ where k is the kth iteration. Now, let us consider two iterative algorithms A and B$.$ Algorithm A has an iteration complexity of O $($log$101$ whilealgorithm B has an iteration complexity of O log$1012$ with $>=1.$ The computational goal of the two algorithms is to achieve the smallest value for the functions log$101$ and log$1012$ in the long run. $1($a$)$ Which algorithm will eventually reach the smallest value? explain. $[5$m$]($b$)$ Is algorithm A a lower bound to algorithm B$?$ explain. $[5$m$]$