Discrete mathematics MCQ, pleaseanswer the mcq, no need for detailedexplanation for the answers, since Ineed the answers ASAP.Consider a sequence defined on the set of non-negative integers as follows:an = -2(-1)" for n2 0.Which among the following is a recursive definition of this sequence?ao = -2, an = -an-1 for n> 0.o ao = 2, a, = -an-1 for n > 0.ao = -2, a, = -2an-1 for n > 0.%3Dao = 2, a, = -2a,-1 for n> 0.%3D%3DAssume we have 20 different covers that can be used for 3 virtually IDENTICAL mobiles. How many different sets of covers we canuse:P(20, 3)C(20, 3)20+20+2020 20 20We want to compute the number of possible strings that contain 3 letters (each letter can be a CAPITAL letter or a small letter).Each string should start with "A" or "a" and should finish with "ZAssume we have 36 flowers to distribute between 5 vases. To compute the minimum number of flowers in a vase that contains themaximum number of flowers, we use:o 36/5=7.2[ 36/5 =7[36/5=836 5-180

Name: Discrete mathematics MCQ, pleaseanswer the mcq, no need for detailede
Uploaded: 2024-03-20T06:38:58.000Z
Channel: Bartleby
Description: Discrete mathematics MCQ, pleaseanswer the mcq, no need for detailedexplanation for the answers, since Ineed the answers ASAP.Consider a sequence defined on the set of non-negative integers as follows:an = -2(-1)" for n2 0.Which among the following