![image](https://assets.leetcode.com/users/images/6dcd3eab-f69d-4cf1-a7ed-a63b6005c9b8_1643680371.0630357.jpeg)\nCan someone provide some help with this question:\n\norbit =[\'Sun)B\',\'B)C\',\'C)D\',\'C)H\',\'B)F\']. \nFind the total number of direct or indirect orbits. For example, in this orbital diagram, D directly revolves around C, because C directly revolves around B, so \nD indirectly revolves around B, and also indirectly around SUN, D has a total of 3 orbits, and C has 2 orbits. \n\nit seems like we need to create a graph using hashmaps and then just traverse it and keep a count of the total number children for each node. However, I am failing at the first step itself. How do I create this graph?\n\norbit =[\'Sun)B\',\'B)C\',\'C)D\',\'C)H\',\'B)F\'].\n\ngraph should be of the form  -   [{D:{C:{B: Sun}}}, {H:{C:{B: Sun}}}, F:{B: Sun}]

\nCan someone provide some help with this question:\n\norbit =[\'Sun)B\',\'B)C\',\'C)D\',\'C)H\',\'B)F\']. \nFind the total number of direct or indirect orbits.