As per Wikipedia, a problem is said to have optimal substructure if an optimal solution can be constructed from optimal solutions of its subproblems. Take the example of the Matrix Chain Multiplication problem below. AxBxCxD where A has dimension 2x3, B has dimension 3x5, C has dimension 5 x 3, and D has dimension 3 xl. (a) What is an optimal solution to the above problem? Show your work in form of a table.
(b) How many subproblems are there to the above problem?
(c) State completely each of the subproblems from (b).
(d) What are the optimal solutions to the subproblem(s) (listed in (c))?

Ayear in the modern gregorian calendar consists of 365 days. in reality, the earth takes longer to rotate around the sun. to account for the difference in time, every 4 years, a leap year takes place. a leap year is when a year has 366 days: an extra day, february 29th. the requirements for a given year to be a leap year are: the year must be divisible by 4if the year is a century year (1700, 1800, the year must be evenly divisible by 400some example leap years are 1600, 1712, and 2016.write a program that takes in a year and determines whether that year is a leap year.ex: if the input is 1712, the output is: 1712 is a leap year.ex: if the input is 1913, the output is: 1913 is not a leap year.

1. declare a constant named cents_per_pound and initialize with 25. 2. get the shipping weight from user input storing the weight into shipweightpounds. 3. using flat_fee_cents and cents_per_pound constants, assign shipcostcents with the cost of shipping a package weighing shipweightpounds.

You are new to microsoft certification and want to start out by getting a certification geared around windows 8. what microsoft certification should you pursue?