The Fibonacci series can be computed as follows, F(n) = F(n 1) + F(n 2) (1) In class, we showed how this can be done in O(log n) computation time. Now suppose that the de nition is changed in the following way, F0(n) = F0(n 1) + F0(n 2) + F0(n 3) + F0(n 4) (2) Can F0(n) be computed in O(log n)? If yes, please show how it can be done. If no, show a counterexample where this fails. Please provide your rationale for both. Assume that F0(0) = 0; F0(1) = 1; F0(2) = 1; F0(3) = 1.

1. you have a small business that is divided into 3 departments: accounting, sales, and administration. these departments have the following number of devices (computers, printers, etc.): accounting-31, sales-28, and administration-13. using a class c private network, subnet the network so that each department will have their own subnet. you must show/explain how you arrived at your conclusion and also show the following: all available device addresses for each department, the broadcast address for each department, and the network address for each department. also, determine how many "wasted" (not usable) addresses resulted from your subnetting (enumerate them).

How should you specify box sizes on a web page if you want the boxes to vary according to the font size of the text they contain? a. in pixels b. in inches c. as percentages d. in em units

Write a fragment of code that reads in strings from standard input, until end-of-file and prints to standard output the largest value. you may assume there is at least one value. (cascading/streaming logic, basic string processing)