Consider a hash table of size 10 with the hash function $h(k) = k \pmod{10}$. Insert the keys 23, 43, 13, 27, 37, and 50 into the hash table. Construct the hash table using separate chaining for collision resolution and then reconstruct it using linear probing. Compare the final arrangements obtained using both methods.