How do you perform integer division without using division or modulo operators, handling edge cases … Interview Question for Meta

Write a function to perform integer division without using the division (/) or modulo (%) operators. The function should take two integers, a dividend and a divisor, as input and return the quotient. Consider edge cases such as division by zero, handling of negative numbers, and potential integer overflow. For example:

1. divide(10, 3) should return 3.
2. divide(7, -2) should return -3.
3. divide(-15, 2) should return -7.
4. divide(-20, -5) should return 4.
5. divide(0, 5) should return 0.
6. divide(5, 0) should raise an exception (division by zero).

Your solution should be efficient and handle both positive and negative integers correctly. Pay attention to potential overflow issues when dealing with large numbers.