Find pair with maximum Appeal value.\n\nInput: Array\nOutput:  index {i, j} ( i = j allowed) with maximum Appeal\nAppeal = A[i] +A[j] + abs(i-j)\n\n**Example 1:**\n```\nInput: [1, 3, -1]\nOutput: [1, 1]\nExplanation: Appeal = A[1] + A[1] + abs(0) = 3 + 3 + 0 = 6\n```\n\n**Example 2:**\n```\nInput: [1, 6, 1, 1, 1, 1, 7]\nOutput: [1, 6]\nExplanation 6 + 7 + abs(1 - 6) = 18\n```\n\n**Example 3:**\n```\nInput: [6, 2, 7, 4, 4, 1, 6]\nOutput: [0, 6]\nExplanation: 6 + 6 + abs(0 - 6) = 18\n```

Find pair with maximum Appeal value.\n\nInput: Array\nOutput:  index {i, j} ( i = j allowed) with maximum Appeal\nAppeal = A[i] +A[j] + abs(i-j)\n\nExample 1:\n