Language is C++

(7) Consider two arrays of size n of type bool. Each array is randomly initialized to a collection of n Boolean values (either true or false). We want to write an algorithm that determines how many times both arrays are set to true at any given index. Let's say we have array A and array B as below. A = faollau)...(an-1] B = [bo][61]...[br-1] We want to check if ao and bo are both true, Q, and b, are both true, ..., finally, an and bn are both true. Which of the below for loops most effectively counts the number of indexes at which A and B are both true. (a) bool a[n]; // Assume A Initialized bool b[n]; // Assume B Initialized int set = 0; for (int i = 0; i<>