3. Solve the following recurrence relations: (a) T(n) = T(n – 2) + n² (b) Т(п) — 2T(n/2) + lg n 1 (с) Т(п) — Т(п — 2) + - lgn

Process or set of rules that allow for the solving of specific, well-defined computational problems through a specific series of commands. This topic is fundamental in computer science, especially with regard to artificial intelligence, databases, graphics, networking, operating systems, and security.