Explanation:

The CPU scheduling algorithm determines the order in which the processes are executed by the CPU. Different algorithms have different characteristics and priorities when it comes to selecting the next process to run. Some algorithms are more suitable for CPU-bound processes, which primarily require CPU time, while others are better for I/O-bound processes, which spend a significant amount of time waiting for I/O operations to complete.

1. Round-robin:
The round-robin scheduling algorithm is a preemptive algorithm that assigns a fixed time slice (also known as a quantum) to each process in the system. Processes are executed in a circular manner, with each process receiving an equal amount of CPU time before being preempted and moved to the back of the queue. This algorithm is fair and ensures that no process monopolizes the CPU for an extended period of time. However, it does not favor CPU-bound processes specifically.

2. First-come-first-served:
The first-come-first-served (FCFS) scheduling algorithm is a non-preemptive algorithm that executes processes in the order they arrive. The CPU is allocated to the first process in the ready queue until it completes or performs an I/O operation. FCFS is a simple and easy-to-implement algorithm but does not consider the execution time or priority of processes. Therefore, it does not favor CPU-bound processes specifically.

3. Multilevel feedback queues:
The multilevel feedback queues scheduling algorithm is a versatile algorithm that uses multiple queues with different priorities. Processes start in a high-priority queue and are moved to lower-priority queues if they use up their time quantum without completing or perform I/O operations. This algorithm allows for different levels of priority and is effective for both CPU-bound and I/O-bound processes. However, it does not specifically favor CPU-bound processes.

Conclusion:
Out of the given options, only the first-come-first-served (FCFS) scheduling algorithm does not favor CPU-bound processes. FCFS simply executes processes in the order they arrive without considering their execution time or priority. Therefore, the correct answer is option 'B' - 2 only.