Let P(n) be the statement that a postage of n cents can be formed using just 4-cent stamps and 7-cent stamps. The Induction and Recursion parts of this exercise outline a strong induction proof that P(n) is true for n > 18. (a) Show that P(18), P(19), and P(20) are true, which com- pletes the base case.
(b) What is the inductive hypothesis?
(c) What do you need to prove in the inductive step?
(d) Complete the inductive step for k > 20.

Given a link with a maximum transmission rate of 32.8 mbps. only two computers, x and y, wish to transmit starting at time t = 0 seconds. computer x sends filex (4 mib) and computer y sends filey (244 kib), both starting at time t = 0. statistical multiplexing is used, with details as follows packet payload size = 1000 bytes packet header size = 24 bytes (overhead) ignore processing and queueing delays assume partial packets (packets consisting of less than 1000 bytes of data) are padded so that they are the same size as full packets. assume continuous alternating-packet transmission. computer x gets the transmission medium first. at what time (t = ? ) would filey finish transmitting? give answer in milliseconds, without units, and round to one decimal places (e.g. for an answer of 0.013777 seconds you would enter "13.8" without the quotes)

Consider the usual algorithm to convert an infix expression to a postfix expression. suppose that you have read 10 input characters during a conversion and that the stack now contains these symbols: (5 points) | | | + | | ( | bottom |_*_| now, suppose that you read and process the 11th symbol of the input. draw the stack for the case where the 11th symbol is

Which device has the most limited computing functionality?