We Define the ___________ of an Algorithm to Be Fn)if,for

Multiple Choice

We define the ___________ of an algorithm to be fn) if,for all n and all inputs of length n the execution of the algorithm takes at most fn) steps.This is a common measure of the efficiency of an algorithm.

A) time complexity
B) one-way function
C) timing attack
D) OAEP