You have given a matrix of colors (Blue and Red). Return the number of\xA0button that are connected the most as well as the least connected buttons. You can traverse in all the directions, e.g. Left, Right, Up Down as well as diagonally.\n\nBoth the buttons can be of same color.\n\n**Example:**\n\n```\ns = [[\'R\', \'R\'], [\'R\', \'B\'], [\'R\', \'R\'], [\'R\', \'B\']]\nreturn [6, 1]\n```\n\n![image](https://assets.leetcode.com/users/images/36505e61-397d-4178-9123-a345cba8640d_1635522737.4222972.png)\n\n**Another Testcase:**\n\n```\ns = [[\'R\', \'R\', \'B\', \'B\', \'R\', \'B\'], [\'R\', \'B\', \'R\', \'B\', \'B\', \'B\']]\nreturn [7, 1]\n```

You have given a matrix of colors (Blue and Red). Return the number of\xA0button that are connected the most as well as the least connected buttons. You can tra