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))?

Match the personality traits with their description

Usually, when we sniff packets, we are only interested certain types of packets. we can do that by setting filters in sniffing. scapy’s filter use the bpf (berkeley packet filter) syntax; you can find the bpf manual from the internet. set the following filters and demonstrate your sniffer program again (each filter should be set separately): (a) capture only the icmp packet. (b) capture any tcp packet that comes from a particular ip and with a destination port number 23. (c) capture packets comes from or to go to a particular subnet. you can pick any subnet, such as 128.230.0.0/16; you should not pick the subnet that your vm is attached to.

What did creator markus “notch" persson initially call his game