##### Find the largest span of two arrays using Bit Algorithms.

Given two arrays of numbers a_{1}, a_{2}, a_{3},...a_{n} and b_{1}, b_{2}, .. b_{n} where each number is 0 or 1, the fastest algorithm to find the largest span(i, j) such that a_{i} + a_{i+1}, ....a_{j} = b_{i} + b_{i+1}, .. b_{j}. or report that there is not such span,

A |
Takes O(n |

B |
Takes O(n |

C |
Takes θ(n) time and space |

D |
Takes O(√n) time only if the sum of the 2n elements is an even number |