JAVA

For each method in this provided file, estimate O(1) or O(n) using Big-O

Create text file named DynArrayBigOSummary.txt Add the following to the file (based on your Big-O analysis on dynamic array):

• Add label "Poorer Performers" and list two methods that were the poorer performers
• Add label "Better Performers" and list two methods that were the better performers

public String get_BigO(int index) { return "YOURANSWER"; } public String first_BigO() { return "YOURANSWER"; } public String last_BigO() { return "YOURANSWER"; } public String find_BigO() { //Hint: this is a linear search return "YOURANSWER"; } //--------------------- Adding --------------------- public String addFirst_BigO() { return "YOURANSWER"; } public String addLast_BigO() { return "YOURANSWER"; } public String add_BigO() { return "YOURANSWER"; } public String insert_BigO() { return "YOURANSWER"; } //--------------------- Removing --------------------- public String removeLast_BigO() { return "YOURANSWER"; } public String removeAll_BigO() { return "YOURANSWER"; } public String removeIndex_BigO() { return "YOURANSWER"; } public String remove_BigO() { return "YOURANSWER"; } //--------------------- Convenience --------------------- public String toJavaList_BigO() { return "YOURANSWER"; }