1. Dividing Two Integers (2’) Given two positive integers A and B (A is a divisor and B is a dividend, as dividend and divisor. Output the integer result of A / B. Please compute the result without using multiplication (*), division (/) and mod(%) operator. Note: 1. The integer division should truncate toward zero, which means losing its fractional part. 2. Divisor cannot be the zero and the output must be a number.

To solve this problem, we can use repeated subtraction to find how many times the divisor can be subtracted from the dividend without going below zero. This will give us the integer result of the division. Here's the code in Python:

def divide(divisor, dividend):
    if divisor == 0:
        return None # Divisor cannot be zero
    if dividend == 0:
        return 0 # Dividend is zero, so result is zero

    # determine sign of the result
    negative = (divisor < 0) ^ (dividend < 0)

    # convert to positive numbers
    divisor = abs(divisor)
    dividend = abs(dividend)

    quotient = 0
    while dividend >= divisor:
        dividend -= divisor
        quotient += 1

    # restore sign of the result
    if negative:
        quotient = -quotient

    return quotient

In this code, we first check if the divisor is zero, which is not allowed. If the dividend is zero, then the result is zero. We also determine the sign of the result by checking if the divisor and dividend have different signs.

We then convert both the divisor and dividend to positive numbers to simplify the repeated subtraction. We use a while loop to subtract the divisor from the dividend until we can no longer do so without going below zero. We keep track of how many times we subtracted the divisor, which is the integer result of the division.

Finally, we restore the sign of the result if necessary and return it. This code should work for any positive integers A and B, as long as A is not zero.