Big-Oh

Given an algorithm whose worst-case running time is f(n)=n and given that the amount of dataisn = 10,000,000 How long would It take this algorithm to complete, assuming that each primitive operation require 1nano-second(i.e. 1billionth of a wood) to execute. Show your work. Given an algorithm whose worst-case running time is f(n) = n^2(i.e. n sqaured), and given that the amount of data is n =10,000,000. How long would ittake this algorithm to complete, assuring that each primitiveoperationrequires1nano-second(i.e., 1billionthofasecond) to execute. Show your work. Give you answer in a readable form (i.e., don't say 86,000 seconds, say instead 1day")