Define a wordNode to be a struct or a class to hold a word

Learning Goal: I’m working on a c++ project and need a sample draft to help me learn.RequirementsWrite a program that will read in a dictionary file from dict_w_defs.json and store it in a Trie Tree.
Define a wordNode to be a struct or a class to hold a word
The binary tree should hold wordNodes.
Time how long it takes to load the data into your binary search tree (we will use that later as well).
After your dictionary (tree) is loaded, we are going to perform “autosuggestions” when a user types characters at the console.
Suggestions will start after 1 character is typed, however only the top 10 suggestions will be printed along with the total number of matching words (example output below).
The time it takes to find each suggestion will be displayed in seconds
I have attached timer.hpp and termcolor.hpp in my zipfile.
Output ExampleUser types the word ste
Below the word the number of words found and the amount of time in seconds will be printed
Only print out the first 10 words of the matching words
ste
62 words found in 0.013 seconds
stead steadfast steadfastly steadfastness steadied steadier steadies steadiest steadily steadiness
User types the word steel

steel
18 words found in 0.003 seconds
steel steele steeled steelers steeles steelhead steelie steelier steelies steeliness
Requirements: Use online IDE replit to run the program