## Discussion Forum

Que. | The running time of the following algorithm Procedure A(n)
If n < = 2 return (1) else return (A(Image not present√nImage not present)); is best described by : |

a. | O(n) |

b. | O(log n) |

c. | O(log Log n) |

d. | O(1) |

Answer:O(log Log n) |