If all the permutations of the word STACK are arranged in dictionary order, then what will be the rank of the wordSTACK

If a dictionary is formed with the words formed using the letters of the word SMART and are arranged in alphabetical sequence, then what is the rank of the word SMART in it?

Stack A has the entries a, b, c (with a on top). Stack B is empty. An entry popped out of stack A can be printed immediately or pushed to stack B. An entry popped out of the stack B can be only be printed. In this arrangement, which of the following permutations of a, b, c are not possible?

Which of the following permutations can be obtained in the output(in the same order),using a stack assuming that the input is the sequence A,B,C,D,E in that order?OptionsC,D,E,A,BC,D,E,B,AC,D,A,B,EC,D,A,E,B

Select the correct answerStack M has the entries 1,2,3(with a on top).Stack N is empty.An entry popped out of stack M can be printed immediately or pushed to stack N.An entry popped out of the stack N can only be printed. In this arrangement, which of the following permutations of 1,2,3 are not possible?Options1,2,32,1,33,2,13,1,2

Stack M has the entries 1,2,3(with a on top).Stack N is empty.An entry popped out of stack M can be printed immediately or pushed to stack N.An entry popped out of the stack N can only be printed. In this arrangement, which of the following permutations of 1,2,3 are not possible?Options3,1,21,2,32,1,33,2,1