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

What did i do wrong with this const discord = require('discord.js'); var bot = new discord.client(); const token = 'ntm3mjcxmtu1mjg3ote2ntq2.dyogew.dpfiwfpuifzuzvifop-csuxasnm' const prefix = "! " bot.registry.registergroup('simple', 'simple'); bot.registry.registerdefaults(); bot.registry. + '/commands'); bot.on('message', message => { if(message.content == 'hi! ') { message.channel.send ('@everyone sup, how is @everyone day going'); } if(message.content == 'h3lp') { message.channel.send ('dose not have any commands yet'); } bot.on('ready', function() { console.log("ready") }); bot.login(token);