I am looking for a C++ program for below given question. (But please remember in C++ only) By following the below given architecture its mentioned where code needs to be written. (Please follow that).

Page_1 :

-----------

Page 2:

-------------

Winning Card In a card game, each player will be given a set of random cards. Players will throw on the table their one winning card, the player with the highest card wins. A winning card is the card that only exists once in the set of cards, and the highest one. Given an array of sets of integers return the card of the winning player. Return If no such card is found. Example 1: Input: cards =[[5,7,3,9,4,9,8,3,1],[1,2,2,4,4,1],[1,2,3]] Output: 8 Example 2: Input: cards =[[5,5],[2,2]] Output: -1 Constraints: - 1>& cards) \{ int res =1 // write your solution here return res; \} \}