An algorithm which tries all the possibilities unless results are satisfactory is and generally is time-consuming is _________

• A. Brute Force
• B. Divide and Conquer
• C. Dynamic programming algorithms
• D. None of the mentioned