Number of words that can be made using all the letters of the word W, if Os as well as Is are separated is?Number of rearrangements of the word “INDIVISIBILITY”How many words, with or without meaning, each of 3 vowels and 2 consonants can be formed from the letters of the word INVOLUTE?How many different words can be formed with the letters of 'SKYSCRAPERS' if A and E are together?Forming seven letter words by using the letters of the word $textSUCCESS$Total no. of words formed when similar letters are involvedNumber of ways to arrange $A,A,A,B,C,C$ such that no $2$ consecutive letters are the sameFind the total number of permutations in which letters of the word $ARRANGEMENT$ can be permuted so that two $E$s and two $R$s do not come together.Find the number of ways in which 6 boys and 6 girls can be seated in a row so that all the girls are never together.What is the number of arrangements in the word “EDUCATION” where vowels are never together?Probability that the first 2 letters are consonants when the letters of the word 'equilibrium' are rearranged
Rock identification in KY
Is it possible to do 50 km distance without any previous training?
Revoked SSL certificate
Accidentally leaked the solution to an assignment, what to do now? (I'm the prof)
How does one intimidate enemies without having the capacity for violence?
Mutually beneficial digestive system symbiotes
Paid for article while in US on F1 visa?
I'm flying to France today and my passport expires in less than 2 months
What defenses are there against being summoned by the Gate spell?
Is it legal for company to use my work email to pretend I still work there?
Was any UN Security Council vote triple-vetoed?
dbcc cleantable batch size explanation
What's that red-plus icon near a text?
Do I have a twin with permutated remainders?
Today is the Center
Languages that we cannot (dis)prove to be Context-Free
How can bays and straits be determined in a procedurally generated map?
Why can't we play rap on piano?
How much of data wrangling is a data scientist's job?
Is it possible to run Internet Explorer on OS X El Capitan?
A newer friend of my brother's gave him load of baseball cards that are supposedly extremely valuable. Is this a scam?
Which country benefited the most from UN Security Council vetoes?
how to check a propriety using r studio
Is it unprofessional to ask if a job posting on GlassDoor is real?
Number of words that can be made using all the letters of the word W, if Os as well as Is are separated is?
Number of rearrangements of the word “INDIVISIBILITY”How many words, with or without meaning, each of 3 vowels and 2 consonants can be formed from the letters of the word INVOLUTE?How many different words can be formed with the letters of 'SKYSCRAPERS' if A and E are together?Forming seven letter words by using the letters of the word $textSUCCESS$Total no. of words formed when similar letters are involvedNumber of ways to arrange $A,A,A,B,C,C$ such that no $2$ consecutive letters are the sameFind the total number of permutations in which letters of the word $ARRANGEMENT$ can be permuted so that two $E$s and two $R$s do not come together.Find the number of ways in which 6 boys and 6 girls can be seated in a row so that all the girls are never together.What is the number of arrangements in the word “EDUCATION” where vowels are never together?Probability that the first 2 letters are consonants when the letters of the word 'equilibrium' are rearranged
$begingroup$
I am facing difficulty in solving the 18th Question from the above passage.
Attempt:
I have attempted it using principal of inclusion and exclusion.
Let n be the required number of ways.
$n = textTotal number of ways - Number of ways in which Os and Is are together$
$implies n = dfrac12!3!2!2! - dfrac11!2!3! - dfrac10!2!2!+ dfrac9!2!2! = 399 times 8!$
This gives $N = 399$ which is wrong. Can you please tell me why am I getting the wrong answer?
combinatorics permutations combinations
asked Mar 28 at 7:09
AbcdAbcd
3,18831339
$endgroup$
add a comment |
$begingroup$
I am facing difficulty in solving the 18th Question from the above passage.
Attempt:
I have attempted it using principal of inclusion and exclusion.
Let n be the required number of ways.
$n = textTotal number of ways - Number of ways in which Os and Is are together$
$implies n = dfrac12!3!2!2! - dfrac11!2!3! - dfrac10!2!2!+ dfrac9!2!2! = 399 times 8!$
This gives $N = 399$ which is wrong. Can you please tell me why am I getting the wrong answer?
combinatorics permutations combinations
asked Mar 28 at 7:09
AbcdAbcd
3,18831339
$endgroup$
1
$begingroup$
How do you know that your solution is wrong? There is also option (D)
$endgroup$
– Robert Z
Mar 28 at 8:29
$begingroup$
@RobertZ answer given is option B
$endgroup$
– Abcd
Mar 28 at 8:30
add a comment |
$begingroup$
I am facing difficulty in solving the 18th Question from the above passage.
Attempt:
I have attempted it using principal of inclusion and exclusion.
Let n be the required number of ways.
$n = textTotal number of ways - Number of ways in which Os and Is are together$
$implies n = dfrac12!3!2!2! - dfrac11!2!3! - dfrac10!2!2!+ dfrac9!2!2! = 399 times 8!$
This gives $N = 399$ which is wrong. Can you please tell me why am I getting the wrong answer?
combinatorics permutations combinations
asked Mar 28 at 7:09
AbcdAbcd
3,18831339
$endgroup$
I am facing difficulty in solving the 18th Question from the above passage.
Attempt:
I have attempted it using principal of inclusion and exclusion.
Let n be the required number of ways.
$n = textTotal number of ways - Number of ways in which Os and Is are together$
$implies n = dfrac12!3!2!2! - dfrac11!2!3! - dfrac10!2!2!+ dfrac9!2!2! = 399 times 8!$
This gives $N = 399$ which is wrong. Can you please tell me why am I getting the wrong answer?
combinatorics permutations combinations
combinatorics permutations combinations
asked Mar 28 at 7:09
AbcdAbcd
3,18831339
asked Mar 28 at 7:09
AbcdAbcd
3,18831339
asked Mar 28 at 7:09
AbcdAbcd
3,18831339
asked Mar 28 at 7:09
AbcdAbcd
3,18831339
asked Mar 28 at 7:09
AbcdAbcd
3,18831339
3,18831339
1
$begingroup$
How do you know that your solution is wrong? There is also option (D)
$endgroup$
– Robert Z
Mar 28 at 8:29
$begingroup$
@RobertZ answer given is option B
$endgroup$
– Abcd
Mar 28 at 8:30
add a comment |
1
$begingroup$
How do you know that your solution is wrong? There is also option (D)
$endgroup$
– Robert Z
Mar 28 at 8:29
$begingroup$
@RobertZ answer given is option B
$endgroup$
– Abcd
Mar 28 at 8:30
1
1
$begingroup$
How do you know that your solution is wrong? There is also option (D)
$endgroup$
– Robert Z
Mar 28 at 8:29
$begingroup$
How do you know that your solution is wrong? There is also option (D)
$endgroup$
– Robert Z
Mar 28 at 8:29
$begingroup$
@RobertZ answer given is option B
$endgroup$
– Abcd
Mar 28 at 8:30
$begingroup$
@RobertZ answer given is option B
$endgroup$
– Abcd
Mar 28 at 8:30
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
Your mistake is not noticing that the I's can be non-separated two different ways: We can have all three of them together as III, but we can also have II in one place and I in another.
One way to calculate how many ways this can happen is to think of one pair II as a single letter, and the third I as a separate letter, and count the number of words we can make. This will count each III case twice: Once as I II, and once as II I. So we have to subtract the number of such cases once.
With this correction, the final calculation becomes
$$
overbracefrac12!3!2!2!^textAll words - overbracefrac11!3!2!^textO's not separate - overbraceleft(underbracefrac11!2!2!_textII and I - underbracefrac10!2!2!_textIIIright)^textI's not separate + overbraceleft(underbracefrac10!2!_textOO, II and I - underbracefrac9!2!_textOO and IIIright)^textNeither O's nor I's separate
$$
which turns out to be $8!cdot 228$.
answered Mar 28 at 8:37
ArthurArthur
122k7122211
$endgroup$
$begingroup$
Thanks for the answer I have understood my mistake, but I am unable to understand the final equation in your answer. Can you label the terms like which term stands for which case?
$endgroup$
– Abcd
Mar 28 at 9:21
$begingroup$
@Abcd I added a short explanation for what each term represents. The basic structure of your inclusion-exclusion calculation is still there, just with the two last terms corrected to make up for the mistake.
$endgroup$
– Arthur
Mar 28 at 9:32
1
$begingroup$
+1 for the MathJax magic!
$endgroup$
– TonyK
Mar 28 at 12:09
add a comment |
$begingroup$
The letter $I$ appears three times. You have calculated the number of ways to arrange the letters so that the three copies of $I$ aren't all in the same place (and also the two $O$s are separated). However, "separated" here means that no two of them are together. Your count includes such "words" as STIILOCATINO, which should be excluded.
answered Mar 28 at 8:38
jmerryjmerry
17k11633
$endgroup$
add a comment |
$begingroup$
How did you get each of the terms of $n$?
$frac12!3!2!2!$ : The number of ways of arranging the letters of SOLICITATION.
$frac11!2!3!$ : The number of ways in which the two $O$s can be together in SOLICITATION.
$frac10!2!2!$ : The number of ways in which the three $I$s can be together in SOLICITATION.
$frac9!2!2!$ : The number of ways in which the three $I$s and two $O$s can be together in SOLICITATION.
Well , the problem is this : the complement of this case, also includes the case where two $I$s can be together and the third can be separate. You have not neglected this case, and that's why you have an answer larger than the given answer.
answered Mar 28 at 8:51
астон вілла олоф мэллбэргастон вілла олоф мэллбэрг
40.3k33678
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3165573%2fnumber-of-words-that-can-be-made-using-all-the-letters-of-the-word-w-if-os-as-w%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Your mistake is not noticing that the I's can be non-separated two different ways: We can have all three of them together as III, but we can also have II in one place and I in another.
One way to calculate how many ways this can happen is to think of one pair II as a single letter, and the third I as a separate letter, and count the number of words we can make. This will count each III case twice: Once as I II, and once as II I. So we have to subtract the number of such cases once.
With this correction, the final calculation becomes
$$
overbracefrac12!3!2!2!^textAll words - overbracefrac11!3!2!^textO's not separate - overbraceleft(underbracefrac11!2!2!_textII and I - underbracefrac10!2!2!_textIIIright)^textI's not separate + overbraceleft(underbracefrac10!2!_textOO, II and I - underbracefrac9!2!_textOO and IIIright)^textNeither O's nor I's separate
$$
which turns out to be $8!cdot 228$.
answered Mar 28 at 8:37
ArthurArthur
122k7122211
$endgroup$
$begingroup$
Thanks for the answer I have understood my mistake, but I am unable to understand the final equation in your answer. Can you label the terms like which term stands for which case?
$endgroup$
– Abcd
Mar 28 at 9:21
$begingroup$
@Abcd I added a short explanation for what each term represents. The basic structure of your inclusion-exclusion calculation is still there, just with the two last terms corrected to make up for the mistake.
$endgroup$
– Arthur
Mar 28 at 9:32
1
$begingroup$
+1 for the MathJax magic!
$endgroup$
– TonyK
Mar 28 at 12:09
add a comment |
$begingroup$
Your mistake is not noticing that the I's can be non-separated two different ways: We can have all three of them together as III, but we can also have II in one place and I in another.
One way to calculate how many ways this can happen is to think of one pair II as a single letter, and the third I as a separate letter, and count the number of words we can make. This will count each III case twice: Once as I II, and once as II I. So we have to subtract the number of such cases once.
With this correction, the final calculation becomes
$$
overbracefrac12!3!2!2!^textAll words - overbracefrac11!3!2!^textO's not separate - overbraceleft(underbracefrac11!2!2!_textII and I - underbracefrac10!2!2!_textIIIright)^textI's not separate + overbraceleft(underbracefrac10!2!_textOO, II and I - underbracefrac9!2!_textOO and IIIright)^textNeither O's nor I's separate
$$
which turns out to be $8!cdot 228$.
answered Mar 28 at 8:37
ArthurArthur
122k7122211
$endgroup$
$begingroup$
Thanks for the answer I have understood my mistake, but I am unable to understand the final equation in your answer. Can you label the terms like which term stands for which case?
$endgroup$
– Abcd
Mar 28 at 9:21
$begingroup$
@Abcd I added a short explanation for what each term represents. The basic structure of your inclusion-exclusion calculation is still there, just with the two last terms corrected to make up for the mistake.
$endgroup$
– Arthur
Mar 28 at 9:32
1
$begingroup$
+1 for the MathJax magic!
$endgroup$
– TonyK
Mar 28 at 12:09
add a comment |
$begingroup$
Your mistake is not noticing that the I's can be non-separated two different ways: We can have all three of them together as III, but we can also have II in one place and I in another.
One way to calculate how many ways this can happen is to think of one pair II as a single letter, and the third I as a separate letter, and count the number of words we can make. This will count each III case twice: Once as I II, and once as II I. So we have to subtract the number of such cases once.
With this correction, the final calculation becomes
$$
overbracefrac12!3!2!2!^textAll words - overbracefrac11!3!2!^textO's not separate - overbraceleft(underbracefrac11!2!2!_textII and I - underbracefrac10!2!2!_textIIIright)^textI's not separate + overbraceleft(underbracefrac10!2!_textOO, II and I - underbracefrac9!2!_textOO and IIIright)^textNeither O's nor I's separate
$$
which turns out to be $8!cdot 228$.
answered Mar 28 at 8:37
ArthurArthur
122k7122211
$endgroup$
Your mistake is not noticing that the I's can be non-separated two different ways: We can have all three of them together as III, but we can also have II in one place and I in another.
One way to calculate how many ways this can happen is to think of one pair II as a single letter, and the third I as a separate letter, and count the number of words we can make. This will count each III case twice: Once as I II, and once as II I. So we have to subtract the number of such cases once.
With this correction, the final calculation becomes
$$
overbracefrac12!3!2!2!^textAll words - overbracefrac11!3!2!^textO's not separate - overbraceleft(underbracefrac11!2!2!_textII and I - underbracefrac10!2!2!_textIIIright)^textI's not separate + overbraceleft(underbracefrac10!2!_textOO, II and I - underbracefrac9!2!_textOO and IIIright)^textNeither O's nor I's separate
$$
which turns out to be $8!cdot 228$.
answered Mar 28 at 8:37
ArthurArthur
122k7122211
edited Mar 28 at 9:32
answered Mar 28 at 8:37
ArthurArthur
122k7122211
answered Mar 28 at 8:37
ArthurArthur
122k7122211
answered Mar 28 at 8:37
ArthurArthur
122k7122211
122k7122211
$begingroup$
Thanks for the answer I have understood my mistake, but I am unable to understand the final equation in your answer. Can you label the terms like which term stands for which case?
$endgroup$
– Abcd
Mar 28 at 9:21
$begingroup$
@Abcd I added a short explanation for what each term represents. The basic structure of your inclusion-exclusion calculation is still there, just with the two last terms corrected to make up for the mistake.
$endgroup$
– Arthur
Mar 28 at 9:32
1
$begingroup$
+1 for the MathJax magic!
$endgroup$
– TonyK
Mar 28 at 12:09
add a comment |
$begingroup$
Thanks for the answer I have understood my mistake, but I am unable to understand the final equation in your answer. Can you label the terms like which term stands for which case?
$endgroup$
– Abcd
Mar 28 at 9:21
$begingroup$
@Abcd I added a short explanation for what each term represents. The basic structure of your inclusion-exclusion calculation is still there, just with the two last terms corrected to make up for the mistake.
$endgroup$
– Arthur
Mar 28 at 9:32
1
$begingroup$
+1 for the MathJax magic!
$endgroup$
– TonyK
Mar 28 at 12:09
$begingroup$
Thanks for the answer I have understood my mistake, but I am unable to understand the final equation in your answer. Can you label the terms like which term stands for which case?
$endgroup$
– Abcd
Mar 28 at 9:21
$begingroup$
Thanks for the answer I have understood my mistake, but I am unable to understand the final equation in your answer. Can you label the terms like which term stands for which case?
$endgroup$
– Abcd
Mar 28 at 9:21
$begingroup$
@Abcd I added a short explanation for what each term represents. The basic structure of your inclusion-exclusion calculation is still there, just with the two last terms corrected to make up for the mistake.
$endgroup$
– Arthur
Mar 28 at 9:32
$begingroup$
@Abcd I added a short explanation for what each term represents. The basic structure of your inclusion-exclusion calculation is still there, just with the two last terms corrected to make up for the mistake.
$endgroup$
– Arthur
Mar 28 at 9:32
1
1
$begingroup$
+1 for the MathJax magic!
$endgroup$
– TonyK
Mar 28 at 12:09
$begingroup$
+1 for the MathJax magic!
$endgroup$
– TonyK
Mar 28 at 12:09
add a comment |
$begingroup$
The letter $I$ appears three times. You have calculated the number of ways to arrange the letters so that the three copies of $I$ aren't all in the same place (and also the two $O$s are separated). However, "separated" here means that no two of them are together. Your count includes such "words" as STIILOCATINO, which should be excluded.
answered Mar 28 at 8:38
jmerryjmerry
17k11633
$endgroup$
add a comment |
$begingroup$
The letter $I$ appears three times. You have calculated the number of ways to arrange the letters so that the three copies of $I$ aren't all in the same place (and also the two $O$s are separated). However, "separated" here means that no two of them are together. Your count includes such "words" as STIILOCATINO, which should be excluded.
answered Mar 28 at 8:38
jmerryjmerry
17k11633
$endgroup$
add a comment |
$begingroup$
The letter $I$ appears three times. You have calculated the number of ways to arrange the letters so that the three copies of $I$ aren't all in the same place (and also the two $O$s are separated). However, "separated" here means that no two of them are together. Your count includes such "words" as STIILOCATINO, which should be excluded.
answered Mar 28 at 8:38
jmerryjmerry
17k11633
$endgroup$
The letter $I$ appears three times. You have calculated the number of ways to arrange the letters so that the three copies of $I$ aren't all in the same place (and also the two $O$s are separated). However, "separated" here means that no two of them are together. Your count includes such "words" as STIILOCATINO, which should be excluded.
answered Mar 28 at 8:38
jmerryjmerry
17k11633
answered Mar 28 at 8:38
jmerryjmerry
17k11633
answered Mar 28 at 8:38
jmerryjmerry
17k11633
answered Mar 28 at 8:38
jmerryjmerry
17k11633
17k11633
add a comment |
add a comment |
$begingroup$
How did you get each of the terms of $n$?
$frac12!3!2!2!$ : The number of ways of arranging the letters of SOLICITATION.
$frac11!2!3!$ : The number of ways in which the two $O$s can be together in SOLICITATION.
$frac10!2!2!$ : The number of ways in which the three $I$s can be together in SOLICITATION.
$frac9!2!2!$ : The number of ways in which the three $I$s and two $O$s can be together in SOLICITATION.
Well , the problem is this : the complement of this case, also includes the case where two $I$s can be together and the third can be separate. You have not neglected this case, and that's why you have an answer larger than the given answer.
answered Mar 28 at 8:51
астон вілла олоф мэллбэргастон вілла олоф мэллбэрг
40.3k33678
$endgroup$
add a comment |
$begingroup$
How did you get each of the terms of $n$?
$frac12!3!2!2!$ : The number of ways of arranging the letters of SOLICITATION.
$frac11!2!3!$ : The number of ways in which the two $O$s can be together in SOLICITATION.
$frac10!2!2!$ : The number of ways in which the three $I$s can be together in SOLICITATION.
$frac9!2!2!$ : The number of ways in which the three $I$s and two $O$s can be together in SOLICITATION.
Well , the problem is this : the complement of this case, also includes the case where two $I$s can be together and the third can be separate. You have not neglected this case, and that's why you have an answer larger than the given answer.
answered Mar 28 at 8:51
астон вілла олоф мэллбэргастон вілла олоф мэллбэрг
40.3k33678
$endgroup$
add a comment |
$begingroup$
How did you get each of the terms of $n$?
$frac12!3!2!2!$ : The number of ways of arranging the letters of SOLICITATION.
$frac11!2!3!$ : The number of ways in which the two $O$s can be together in SOLICITATION.
$frac10!2!2!$ : The number of ways in which the three $I$s can be together in SOLICITATION.
$frac9!2!2!$ : The number of ways in which the three $I$s and two $O$s can be together in SOLICITATION.
Well , the problem is this : the complement of this case, also includes the case where two $I$s can be together and the third can be separate. You have not neglected this case, and that's why you have an answer larger than the given answer.
answered Mar 28 at 8:51
астон вілла олоф мэллбэргастон вілла олоф мэллбэрг
40.3k33678
$endgroup$
How did you get each of the terms of $n$?
$frac12!3!2!2!$ : The number of ways of arranging the letters of SOLICITATION.
$frac11!2!3!$ : The number of ways in which the two $O$s can be together in SOLICITATION.
$frac10!2!2!$ : The number of ways in which the three $I$s can be together in SOLICITATION.
$frac9!2!2!$ : The number of ways in which the three $I$s and two $O$s can be together in SOLICITATION.
Well , the problem is this : the complement of this case, also includes the case where two $I$s can be together and the third can be separate. You have not neglected this case, and that's why you have an answer larger than the given answer.
answered Mar 28 at 8:51
астон вілла олоф мэллбэргастон вілла олоф мэллбэрг
40.3k33678
answered Mar 28 at 8:51
астон вілла олоф мэллбэргастон вілла олоф мэллбэрг
40.3k33678
answered Mar 28 at 8:51
астон вілла олоф мэллбэргастон вілла олоф мэллбэрг
40.3k33678
answered Mar 28 at 8:51
астон вілла олоф мэллбэргастон вілла олоф мэллбэрг
40.3k33678
40.3k33678
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3165573%2fnumber-of-words-that-can-be-made-using-all-the-letters-of-the-word-w-if-os-as-w%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
$begingroup$
How do you know that your solution is wrong? There is also option (D)
$endgroup$
– Robert Z
Mar 28 at 8:29
$begingroup$
@RobertZ answer given is option B
$endgroup$
– Abcd
Mar 28 at 8:30