Consider the matrix chain multiplication problem that is discussed in class. does this problem belongs to complexity class p, np, or none of them? prove your answer note: to prove belonging to p class, you need to provide a polynomial time solution algorithm pseudo code and analyze its complexity. to prove belonging to np class, you need to provide a polynomial time verification algorithm pseudo code and analyze its complexity.

According to my brain it's a rational number because it can be put as a fraction

Company has asked employees for suggestions on ways to personalize the retail customer's shopping experience. they want to supplement traditional appeals to the customer. you have come up with several ideas. select the idea or ideas you have decided to submit.c. designate two of the curtained areas in the women's dressing room for nursing mothers  d. tailor merchandise in each store to the preferences of customers in that geographical region