Scraper on Amazon (Germany) website across all product groups

Dear all,

I need to scrape something from www.amazon.de (Germany site). I need the following information across ALL Amazon product groups until the lowest possible product group in their product hierarchy. Don’t know exactly how many those are on the lowest level but would expect in the thousands. JFIY: This site says that there are c. 25 first level categories and between 2-10 second level categories
https://sellercentral.amazon.de/gp/help/external/G200332540?language=de_DE

Would expect that the numbers of hierarchies vary across the product groups; for us it is important to always drill down to the lowest possible one. Please see attached example below for helmet covers (which is one example of a lowest possible one) it seems that 6 category levels are needed to drill down.

The output of this project should be an excel file with 1 row per lowest product hierarchy. The columns of the excel should contain …

A | General information for navigation purposes:
1. Several columns on the information on the higher product hierarchies that the lowest possible one (the one that the row corresponds to) is embedded in; e.g. hierarchy 1, 2, 3, 4, 5, 6, + lowest possible one that the row corresponds to


B | Specific quantitative information on the lowest possible product groups (per row) in the hierarchy:
2. # of products displayed on first page
3. # of ratings on first page (across all products displayed)
4. # of sponsored (advertised) products on first page
5. # ratings for top displayed 15 products (across all 15 products) on first page
6. # of sponsored (advertised) products for top 15 displayed products on first page
7. # of ratings for the #1 listed not-sponsored (not-advertised) product on first page
8. # of ratings for the #5 listed not-sponsored (not-advertised) product on first page
9. # of ratings for the #10 listed not-sponsored (not-advertised) product on first page

Looking forward to your offers. Please of course let me know if any of the requirements from the points 2-9 are technically not feasable or take exceptionally long. Then we can maybe think about work-arounds.

Many thanks and very best,
Felix