(1) give a recursive definition of the set p of all positive integers greater than 5,
(2) formulate the applicable induction principle and
(3) then apply the induction principle to prove that
2n - 3 = 2^(n-2) for all n > 5.

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?