Let be an alphabet. Let xi g for 1 < i < 100 (where

Question:

Let ∑ be an alphabet. Let xi g ∈ for ∑ 1 < i < 100 (where xi ≠ xj for all 1 < i < j < 100). How many nonempty substrings are there for the string s = x1x2 ∙∙∙∙∙∙ x100?
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: