I should create an algorithm and implement it using scratch. PLEASE PLEASE HELP. A carpenter is cutting a long plank of wood of length N cm. Each cutting has fixed width
of 2 cm lengths. Given that each length has a price, Now, we are required to help this
carpenter to find the optimal cuts in order to increase his profit. Consider following
example showing different cut’s lengths and their equivalent prices.
Input: Plank length = 4
Length [ ] = [1, 2, 3, 4, 5, 6, 7, 8]
Price [ ] = [2, 6, 8, 10, 14, 17, 19, 20]
Output: Best cut is two pieces of length 2 each to gain revenue of 6 + 6 = 12

Suppose we have a byte addressable computer that has a 32-byte cache with 8 bytes per block. the memory address is 8 bits long. the system accesses memory addresses (in hex) in this exact order: 6e, b9, 17, e0, 4e, 4f, 50, 91, a8, ab, ad, 93, and 94. (a) assuming the cache is direct mapped, what memory addresses will be in cache block 2 after the last address has been accessed? (b) assuming the cache is direct mapped, what is the hit ratio for the entire memory reference sequence given, assuming the cache is initially empty? (c) assuming the cache is 2-way set associative with a lru replacement policy, what is the hit ratio?

Asecurity policy is a a. set of guidlines b. set of transmission protocols c. written document d. set of rules based on standards and guidelines

Which of the following is not a key player in the sale of travel products?