For each of the following algorithms write its running time as a mathematical function of the input size (n), considering worst case scenario. 1) Array Bag: getFrequancy)T obj). 2) LinkedListWithTail: add(T obj). 3) Linked Bag: remove(T obj). 4) ArrayBag: getIndexOf(T obj). 5) for(int i=0: i