Imagine a Table named Group, each group can have ‘child’ groups as long as they’re of lower ‘level’. So there is one-to-many relationship between Group and childGroup table.

There is also a many-to-many relation between Group and Items so Groups_Items is used to hold the FK of each table.
I need to write a query where for a given Group key, i should find all its child groups, all the childs of child groups, and all the customers belonging to those found groups.
I know it needs to be a recursive query of some sort but i have no idea how this can be done in SQL. Below is the structure of the tables discussed:

so if i had these data set in the above tables:

And the query was to find For Group 1, find Its customers, Its Child groups (and their Childs) and all their customers, the output should be:
<Group> 1
<customer> 1
<customer> 2
<Group> 2
<customer> 2
<Group> 3
<Group> 4
Can someone please show me how this can be done? thanks
I hope I understood your question
an older attempt would be