Find the asymptotic behavior of the following example functions: 1. f(n) = 117 2. f(n) = 12n" + 3n7 3. f(n) = 8n* + 153n + 16n2 4. f(n) = 54n 5. f(n) = 23n3 + 48n Count the operations for the following code segments. If you cannot accurately count the operations specify why and then estimate the big o for the segment. 1. string colorTypetoString(colorType theColor) { switch(theColor) { case ORANGE: return "Orange"; case GREEN: return "Green"; case YELLOW: return "Yellow"; case BLUE: return "Blue"; } return "Unknown"; } 2. void inputList(int list[], string wordList[], int listSize) { ifstream words; words.open("wordlist.txt"); for(int i = 0; i > list[i]; cout > list[i]; } words >> WordList[i]; } }