Let \( S \) be the set of all the words that can be formed by arranging all the letters of the word GARDEN. From the set \( S \), one word is selected at random. The probability that the selected word will NOT have vowels in alphabetical order is:
\( \dfrac{1}{3} \)
\( \dfrac{2}{3} \)
\( \dfrac{1}{2} \)
\( \dfrac{1}{4} \)
