Which of the following statements is true about Bubble Sort?It is an unstable sorting algorithm.It does not perform well on large lists.It is faster than Quick Sort in the worst case.It requires more memory than Merge Sort.

The true statement about Bubble Sort from the given options is: "It does not perform well on large lists."

Here's why:

1. Bubble Sort is a stable sorting algorithm, not unstable. This means that equal elements remain in their original order even after sorting.

2. Bubble Sort indeed does not perform well on large lists. It has a worst-case and average time complexity of O(n^2), where n is the number of items being sorted. This makes it inefficient on large lists.

3. Bubble Sort is not faster than Quick Sort in the worst case. Quick Sort, on average and best case, performs better than Bubble Sort with a time complexity of O(n log n). However, Quick Sort's worst-case time complexity is O(n^2), which is similar to Bubble Sort, but it rarely reaches its worst-case scenario.

4. Bubble Sort does not require more memory than Merge Sort. Bubble Sort is an in-place sorting algorithm, which means it only requires a constant amount O(1) of additional memory space. On the other hand, Merge Sort requires additional space proportional to the input size, i.e., O(n), making it more memory-intensive than Bubble Sort.