java

Programming challenge description: ESG Issuer Data is of the form Issuer | Parent | ESG Rating A54365 | 334454 AA B34454 | 34563 A D45 747 334454 B E36547 | 045747 | AAA 634657 D45747 | CCC H84464 034563 | BB 176474 | HS4464 AA 034563 1 BBB F34654 1 BB 074576 | K46565C K46565 1 1.54334 | 176474 H84464 | 154334 | BB 1. If asked to find a min or max rating, given an issuer, consider all the issuers in the path from the given issuer to the ultimate parent 2. Rating order AAA > AA > A > BBB > BB > B> CCC > CC > C Your assignment: Come up with a Data Structure to hold this type of data. Write an algorithm to check if the relations above are cyclic in nature. (Convert the Data Structure to a directed one assuming the direction is from the Issuer to its parent) Find the issuer with max rating Input: The issuer table, with respective columns: Issuer parent Esgrating separated by Output: If relations from the input table are cyclic in nature cyclic or noncyclic issuer with max rating, return None if invalidot applicable max rating, return None if invalidot applicable Test 1 Test Input A54365 | B34454CCC B34454C34563|A D45747B344541B E365471045747/AAA G34657|0457471 CCC H84464 C34563 | BB 176474H84464AA C345631 (BBB F346541 | BB J74576|K4656SIC K465651 ICC L54334|176474|AA 8844641 | BB Expected Output noncyclic C34563 BBB Test Input AS43651B34454AA B34454034563|A D457471B34454/B E365471D45747AAA G346571D45747CCC H844641C34563 | BB 176474484464AA C345631|BBB F34654BB 374576(K465651C K465651 ICC LS4334|176474AA H84464|L54334 | BB Expected Output cyclic A54365 AA