Q5-15 pts) Two pairs of integers (a, b) and (c, d) are said to be symmetric ifb c anda d. For example, given an array of pairs 131, 57, 180, 90), 125, 70), (90, 80), 170, 25), 111, 20), 110, 5), (30, 40 3, the symmetric pairs are: (80, 90) and (90, 80 (25, 70; and (70, 25) Design a hash table-based algorithm of time complexity 0(n) to identify the symmetric pairs in an array of 'n' pairs. Show the working of your algorithm for the above array of pairs with a hash function H(K) K mod 7