Consider a binary max heap data structure H with n elements that supports the operations insert and extract_max. Recall that the actual cost of one insert is O(log(n)) and the actual cost of extract_max is O(log(n)). What potential functions P(H) would yield an amortized cost of insert of O(log n) and the amortized cost of extract-max of O(1)?

Write an assembly language program to input a string from the user. your program should do these two things: 1. count and display the number of words in the user input string. 2. flip the case of each character from upper to lower or lower to upper. for example if the user types in: "hello there. how are you? " your output should be: the number of words in the input string is: 5 the output string is : hello there. how are you?