You are designing a heuristic for a path-finding problem on a grid where diagonal movement is allowed and costs the same as horizontal/vertical movement (cost = 1). Would the Manhattan Distance be an admissible heuristic? Explain why or why not with a counter-example.