This is for Java in my Data structures class:

5. Algorithm A does a particular task in a "ime of N3 where N is the number of where IV 1s the number o elements processed. Algorithm B does the same task in a "time" of 3N 1000. (a) What is the Big-O efficiency of each algorithm? (b) Which algorithm is more efficient by Big-O standards? (c) Under what conditions, if any, would the "less efficient" algorithm execute more quickly than the "more efficient" algorithm