Identify each of the following algorithms as possible (this algorithm could be executed on a computer), noncomputable (this algorithm can never be written or executed by any computer), or impractical (this algorithm has exponential run time and requires too long for computers to execute, except in restricted cases). a. A program to crack any decryption scheme a terrorist could use. b. A program to analyze any other program and tell you if it solved your particular problem. c. A program to calculate the census for the United States. d. A program to analyze traffic flow through a city by examining every possible combination of possible turns for every automo- bile in the city. e. A program to print all of the words in an English dictionary. f. A program to explore every possible search engine expression compared to a single web page. (You may assume that the search expression is limited to say 256 characters in length.)