given in code fragment which assumes the following additional property on the labels of the nodes in the compact representation of the suffix trieif node has label ( ,jand is the string of length associated with the path from the root to (included)then [ = this property ensures that we can easily compute the start index of the pattern in the text when match occurs code fragment pattern matching with suffix trie we denote the label of node with (start( ),end( ))that isthe pair of indices specifying the substring of the text associated with