a) In reference to algorithm analysis, explain performance based on the number of basic operations executed b) In the same reference also explain problem cost vs. program cost Solution Answer : ( a )The run-time complexity for the worst-case scenario of a given algorithm can sometimes be evaluated by examining the structure of the algorithm and making some simplifying assumptions.A given computer will take a discrete amount of time to execute each of the instructions involved with carrying out an algorithm. The specific amount of time to carry out a given instruction will vary depending on which instruction is being executed and which computer is executing it. ( b ) Problem cost comprises of cost of understanding ,programming and cost of running a program where as program cost comprises cost of running a program . .