operating systems – Algorithm favours CPU bound or I/O bound processes

Some scheduling algorithms favour CPU bound processes while others favour I/O bound processes.

Which algorithm favours which type of process?
My answers:

  1. SJF favours I/O bound processes.
    Explanation: Short CPU burst processes(I/O bound processes) are given higher priority.
  2. SRTF favours I/O bound processes.
    Explanation: Same as SJF
  3. Round Robin? Not able to decide categorically
  4. LRTF favours CPU bound processes.
    Explanation: Large CPU burst processes(CPU bound) are given higher priority.
  5. HRRN? Not able to decide categorically
  6. Multilevel feedback Queue favours I/O bound processes.
    Explanation: Short CPU burst processes(I/O bound processes) are given higher priority. While processes that have large CPU bursts(CPU bound) will slowly have decrement in priority. A process in lower priority queue can only execute when higher priority queues are empty. A process running in a lower priority queue is interrupted by a process arriving in a higher priority queue.
  7. Multilevel Queue favours I/O bound processes.
    Explanation: Similar to multilevel feedback.
  8. Priority Scheduling? Not able to decide categorically
  9. FCFS? Not able to decide categorically

Please verify above answers and explanations.
Correct me if I’m wrong somewhere and provide answers with explanation for the omitted ones.