Arrange the following functions in a list so each function is Big-O of the next one in the list (i.e., if the functions are listed fi(n), f2(n), ..., fi(n), then fi(n) e O(f2(n)), fa(n) e O(fs(n)), etc.): log n', log log 8n, v6n, n!, 6n log n, n . 2", log 2", 1056, 3", log 2Vn Show your work, not just the final list. Assume all logarithms are base 2