State whether each of the following statements is true or false.

1). An algorithm is a sequence of unambiguous instructions for solving a problem, i.e., for obtaining a required output for any legitimate input in an infinite amount of time.

2). We can sort, search and manipulate large volume of data without using arrays.

3). To perform a sequential search the data set must be sorted.

4). To perform a binary search the data set must be sorted.

5). Hackers use exhaustive search for an element with special property.

6). BFS has same efficiency as DFS and can be implemented with graphs.

7). A dag: a directed acyclic graph, i.e. a directed graph with no (directed) cycles.

8). To generate permutation for a set of N object we can use brute force.

9). Binary search can be done using divide and conquer.

10). Exponentiation can be done by Squaring