Implement Trie $-1$

Problem Statement: Implementing insertion, search, and startWith operations in a trie or prefix$-$tree.

Implementation:

Type $1$: To insert a string "word" in Trie.

Type $2$: To check if the string "word" is present in Trie or not.

Type $3$: To check if there is any string in the Trie that starts with the given prefix string "word".

skip it otherwise $10-12$ dislike confirm on your account.

skip it otherwise $10-12$ dislike confirm on your account.