Verifying an Alien Dictionary

Statement

You’re given an array of words with lowercase English letters in a different order, written in an alien language. The order of the alphabet is some permutation of lowercase letters of the English language.

We have to return TRUE if the given array of words is sorted lexicographically in this alien language.

Constraints:

• $1 \leq$ words.length $\leq 10^3$
• $1 \leq$ words[i].length $\leq 20$
• order.length $== 26$
• All the characters in words[i] and order are lowercase English letters.

Examples